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.
Threads: Enter array of n integers. Find the largest and smallest number in array. Input: The first line is an integer n. The second line 2 n is an integer array, of numbers separated by spaces. Output: A line of 2 số là số lớn nhất và nhỏ
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
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
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
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
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
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
Threads: Enter a non-negative integer decimal system. Convert them to binary. Input: An integer n. Output: Binary number of n. For example: input: 2 output: 10
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
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
