題意就是有N個(gè)pl妹子，然后每行第一個(gè)單詞是妹子的國籍，后面是妹子的名字。

你的任務(wù)就是統(tǒng)計(jì)相同國籍妹子的個(gè)數(shù)，然后按字母表順序輸出。

我首先把所有的國籍都讀入，然后用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, inGermany 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``beauties'' by their nationality each time. You are to help Leporello tocount.

Input

The input consists of at most?2000?lines, but the first. The first linecontains a number?n,indicating that there will be?n?more lines. Each following line, withat most?75?characters, 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代碼：

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 LOCAL 11 freopen("10420in.txt", "r", stdin); 12 #endif 13 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 } 代碼君

?

轉(zhuǎn)載于:https://www.cnblogs.com/AOQNRMGYXLMV/p/3817596.html

總結(jié)

以上是生活随笔為你收集整理的UVa 10420 List of Conquests的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。