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.

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 n is an integer array, of numbers separated by spaces.
Output: The first line contains the number m is the number of different, Next m lines each containing 2 numbers separated by spaces, respectively, and the amount of occurrence of which. m lines sorted in ascending value of the number of arrays.
For example:

input:
4
4 3 3 2
output:
3
2 1
3 2
4 1

You are not logged in? Log in to Submit Now!

7 Comments

Add a Comment