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: Arrays

## Sort the array in ascending

Threads: Write a program to input an array of integers. Sort the array in ascending order Input: include 2 current, The first line is an integer number of elements of the sequence, second line 2 is a sequence of n integers (n>=1), Each integer is separated by a space. Output: to be

## HK2 MAJOR WEIGHT

Threads: They want to investigate the weight of n students in class 8 Tran Quang Khai Secondary School. Write a program to input an integer (1<n <=150) is the number of students to be investigated and the sequence includes n integers a1,a2,a3,…an (0<ai<100) is the weight of each student

## Check array symmetry

Threads: For an array of n integers. Check if the array is mirrored. Plate symmetric arrays when writing in the forward or reverse are identical results. Input: The first line is an integer n. The second line 2 n is an integer array, the number of ways

## Check array ascending

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

## The most number of occurrences

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

## Count the number of Advanced

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

## Count the number of

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

## Three largest

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

## Sort array

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

## Separation of yin and yang in the array

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