WEBSITE RETURNED, HOWEVER SUBMIT QUANTITY IS RESTRICTED PER DAY TO VERY LITTLE (UNDER JUDGE0 NEW POLICY, API PROVIDER). Therefore it is very much for you to pay attention TEST CAREFULLY CODE BEFORE SUBMIT.

Category: Loop

Find the first k primes

Threads: Enter a positive integer k, prints a list of the first k primes. Input: An integer k. Output: A line consists of the first k primes. The numbers separated by spaces. For example: input: 2 output: 2 3

Average prime numbers less than k

Threads: Enter an integer k, Calculate and print out the average of the prime numbers less than or equal to k. Input: An integer k. Output: A unique number is the average of the prime numbers less than or equal to k. Results rounded to

Smaller prime numbers k

Threads: Enter an integer k, print out a list of prime numbers less than k. Input: An integer k. Output: A line of smaller prime numbers k, each number separated by spaces. Without any prime number less than k, then

count the number

Threads: For an array of integers, each number separated by a space. Ending sequence is the number 0. Find the largest number, the smallest in the range and number of numbers in sequence (not count 0 Last row). Input: A sequence of numbers separated by spaces. Last number

Find gCD, BCNN

Threads: Input 2 integer. Find the greatest common divisor (UCLN) and the least common multiple (BCNN) of them. Input: A line of 2 positive integers separated by spaces. Output: A line of 2 numbers separated by spaces that GCD, BCNN of 2 some have

Prime factors

Threads: Input 1 number, analysis of which achievement of the prime factors. Input: A positive integer. Output: Integrated chain of alternating prime factors by commas *. Factors Descending. For example: input: 6 output: 2*3

Total with reverse

Threads: Enter an integer n. The sum of n and its reverse number. Input: Some n. Output: The total to be calculated. For example: input: 123 output: 444

Biggest digit

Threads: Enter an integer n. Find the biggest digit digits that n. Input: Some n. Output: Some of the largest digit in n. For example: input: 123 output: 3

Reverse number

Threads: Enter an integer n (0 < n <= 10 billion). Print out the reverse of the n. Input: Some n. Output: Some are the reverse of n. For example: input: 123 output: 321

Check perfect number

Threads: Write test program 1 there is the perfect number does not? Perfect number is a positive integer equal the sum of the positive divisors 2 times it. example No. 6 the Convention 1, 2, 3, 6 and total 1 + 2 + 3 + 6 = 12 (equal 2 time