Ultraviolet A 10420 list of conquests

There are n PL sisters, and the first word in each line is the nationality of the sister, followed by the sister's name.

Your task is to count the number of Sisters of the same nationality, and then output in alphabetical order.

First, I read all the nationalities and then sorted them alphabetically by qsort.

 

 

List of conquests
Input:Standard Input
Output:Standard output
Time limit:2 seconds

In Act I, Leporello is telling Donna elviraabout his master's long list of conquests:

''This is the list of the beauties my master has loved, a list I 've madeout myself: Take a look, read it with me. in Italy six hundred and forty, ingerw.two hundred and thirty-one, a hundred in France, ninety-one in Turkey; but in Spain already a thousand and three! Among them are country girls, waiting-maids, city beauties; there are countesses, baronesses, marchionesses, Princesses: women of every rank, of every size, of every age .''(Madamina, il catalogo è questo)

As Leporello records all the ''beauties ''Don giovanni'' 'loved' in chronological order, it is very troublesome for him to present hismaster's conquest to others because he needs to count the number of ''beauty'' by their nationality each time. you are to help Leporello tocount.

Input

The input consists of at most2000Lines, but the first. The first linecontains a numberN, Indicating that there will beNMore lines. Each following line, Withat most75Characters, contains a country (thefirst word) and the name of a woman (the rest of the words in the line) Giovanni loved. you may assume that the name of all countries consist of onlyone word.

Output

The output consists of lines in alphabetical order. eachline starts with the name of a country, followed by the total number of womengiovanni loved in that country, separated by a space.

Sample Input

3

Spain Donna Elvira

England Jane Doe

Spain Donna Anna

Sample output

England 1

Spain 2

Problem-setter: Thomas Tang, Queens University, Canada

 

AC code:

 1 //#define LOCAL 2 #include <iostream> 3 #include <cstdio> 4 #include <cstring> 5 #include <algorithm> 6 using namespace std; 7  8 int main(void) 9 {10     #ifdef LOCAL11         freopen("10420in.txt", "r", stdin);12     #endif13 14     int cmp(const void *a, const void *b);15     int N, i, j;16     char country[2005][80], c[200];17     scanf("%d", &N);18     for(i = 0; i < N; ++i)19     {20         scanf("%s", country[i]);21         gets(c);22     }23     qsort(country, N, sizeof(country[0]), cmp);24 25     i = 0;26     while(i < N)27     {28         j = i;29         while(strcmp(country[j], country[i]) == 0 && j < N)30         {31             ++j;32         }33         cout << country[i] << " " << j - i << endl;34         i = j;35     }36     return 0;37 }38 int cmp(const void *a, const void *b)39 {40     return strcmp((char *)a, (char *)b);41 }

Code Jun