24h購物| | PChome| 登入
2012-04-01 16:34:28| 人氣5,052| 回應0 | 上一篇 | 下一篇

[UVA][Map] 10420 - List of Conquests

推薦 0 收藏 0 轉貼0 訂閱站台

Problem B
List of Conquests
Input: standard input
Output:
standard output
Time Limit:
2 seconds

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

``This is the list of the beauties my master has loved, a list I've made out myself: take a look, read it with me. In Italy six hundred and forty, in Germany 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 his master's conquest to others because he needs to count the number of ``beauties'' by their nationality each time. You are to help Leporello to count.

Input

The input consists of at most 2000 lines, but the first. The first line contains a number n, indicating that there will be n more lines. Each following line, with at most 75 characters, contains a country (the first 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 only one word.

Output

The output consists of lines in alphabetical order. Each line starts with the name of a country, followed by the total number of women Giovanni 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


紀錄第一個國家的名字與個數
接著輸出依照字典順序輸出國家及個數

#include <iostream>
#include <cstdio>
#include <string.h>
#include <map>
using namespace std;
int main() {
    int n;
    map<string, int> record;
    while(scanf("%d", &n) == 1) {
        string country, tmp;
        while(n--) {
            cin >> country;
            record[country]++;
            getline(cin, tmp);
        }
        for(map<string, int>::iterator i = record.begin(); i != record.end(); i++)
            cout << i->first << " " << i->second << endl;
    }
    return 0;
}

台長: Morris
人氣(5,052) | 回應(0)| 推薦 (0)| 收藏 (0)| 轉寄
全站分類: 不分類 | 個人分類: UVA |
此分類下一篇:[UVA][Map] 10226 - Hardwood Species
此分類上一篇:[UVA][DP] 11258 - String Partition

是 (若未登入"個人新聞台帳號"則看不到回覆唷!)
* 請輸入識別碼:
請輸入圖片中算式的結果(可能為0) 
(有*為必填)
TOP
詳全文