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: For an array of n integers. Check that the array ascending. Ascending array is larger array that follows the previous number. Input: The first line is an integer n. The second line 2 n is an integer array, of numbers separated by spaces. Output: If
Threads: For an array of n integers. Find the number that appears most in the array. The number in the array is between 0 come 1000. n <= 100. Input: The first line is an integer n. The second line 2 n is an integer array, of numbers separated by spaces. Head
Threads: For an array of n integers. Plate count in how many different numbers and each number appears many times in the array. The number in the array is between 0 come 1000. n <= 100. Input: The first line is an integer n. The second line 2 to be
Threads: For an array of n integers. Plate count in how many different numbers and each number appears many times in the array. The number in the array is between 0 come 1000. n <= 100. Input: The first line is an integer n. The second line 2 to be
Threads: For an array of n integers. Finding 3 the largest number in the array. Input: The first line is an integer n (n>=3). The second line 2 n is an integer array, of numbers separated by spaces. Output: A line of 3 the largest number in the order of most, second, ba
Threads: For an array of n integers. Printed on 2 line arrays respectively arranged vertically rising and descending. Input: The first line is an integer n. The second line 2 n is an integer array, of numbers separated by spaces. Output: two lines, on line
Threads: For an array of n integers. Printed on 2 line respectively negative and positive numbers of the sequence. Input: The first line is an integer n. The second line 2 n is an integer array, of numbers separated by spaces. Output: two lines, the line above is
Threads: For an array of n integers. Find and print the largest negative 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 negative number is the largest number found. Nếu dãy
Threads: For an array of n integers. Find and print out the square numbers in the array. Input: The first line is an integer n. The second line 2 n is an integer array, of numbers separated by spaces. Output: Một dòng gồm nhiều số cách nhau bởi dấu cách là
Threads: For an array of n integers. On average in the array primes. Input: The first line is an integer n. The second line 2 n is an integer array, of numbers separated by spaces. Output: Some are medium primes. Kết quả làm
