SBANK - Sorting Bank Accounts


In one of the internet banks thousands of operations are being performed every day. Since certain customers do business more actively than others, some of the bank accounts occur many times in the list of operations. Your task is to sort the bank account numbers in ascending order. If an account appears twice or more in the list, write the number of repetitions just after the account number. The format of accounts is as follows: 2 control digits, an 8-digit code of the bank, 16 digits identifying the owner (written in groups of four digits), for example (at the end of each line there is exactly one space):

30 10103538 2222 1233 6160 0142 

Banks are real-time institutions and they need FAST solutions. If you feel you can meet the challenge within a very stringent time limit, go ahead! A well designed sorting algorithm in a fast language is likely to succeed.

Input


t [the number of tests <= 5]
n [the number of accounts<= 100 000]
[list of accounts]
[empty line]
[next test cases]

Output


[sorted list of accounts with the number of repeated accounts]
[empty line]
[other results]

Example

Input:
2
6
03 10103538 2222 1233 6160 0142 
03 10103538 2222 1233 6160 0141 
30 10103538 2222 1233 6160 0141 
30 10103538 2222 1233 6160 0142 
30 10103538 2222 1233 6160 0141 
30 10103538 2222 1233 6160 0142 

5
30 10103538 2222 1233 6160 0144 
30 10103538 2222 1233 6160 0142 
30 10103538 2222 1233 6160 0145 
30 10103538 2222 1233 6160 0146 
30 10103538 2222 1233 6160 0143 

Output:
03 10103538 2222 1233 6160 0141 1
03 10103538 2222 1233 6160 0142 1
30 10103538 2222 1233 6160 0141 2
30 10103538 2222 1233 6160 0142 2

30 10103538 2222 1233 6160 0142 1
30 10103538 2222 1233 6160 0143 1
30 10103538 2222 1233 6160 0144 1
30 10103538 2222 1233 6160 0145 1
30 10103538 2222 1233 6160 0146 1

hide comments
dheerajdheeru: 2018-06-12 03:11:57

AC in one GO
my 55th problem

imkiller: 2018-06-03 07:23:23

Simple Map Ac in oneGo!

aayushbhaskar: 2018-05-27 10:20:08

No data structure required, ran in 0.45s, AC in one go

aakash2509: 2018-05-25 17:26:10

Don't forget to use cin.ignore(); before the test case loop to ignore the previous extra line.! It will give u unexpected output even though the code is right.

Very nice problem will teach you a lot about STL .

kuchnahiaata: 2018-03-16 10:06:08

just take care of the I/O!

sandilya1599: 2018-01-10 17:30:28

AC in 1 Go :)

atulav: 2017-12-31 11:45:39

map rocks !!!

Last edit: 2017-12-31 11:45:50
hercules_7: 2017-12-30 22:17:35

map and print :-D AC 0.00 sec

abigail_ii: 2017-12-29 21:18:51

Puzzled by the comment you need a well designed sort algorithm in a fast language. I used a plain sort in Perl (not exactly known to be a fast language) and it ran in 0.42 seconds.

hitesh87: 2017-12-13 17:39:28

Only maps nothing else.


Added by:mima
Date:2004-06-01
Time limit:7s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: NODEJS PERL6 VB.NET
Resource:-