排序/查找 10420 - List of Conquests

UVa OJ

Root :: AOAPC I: Beginning Algorithm Contests (Rujia Liu) :: Volume 1. Elementary Problem Solving :: Sorting/Searching

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<cstring>
#include<cstdio>
#include<ctype.h>
#include<algorithm>
#include<string.h>
#define MAXN 2010
struct node
{
    char name[100];
    int num;
}coun[MAXN];
bool cmp(node s, node v)
{
    return (strcmp(s.name,v.name)<0);
}
using namespace std;
int main ()
{
    int n,i,j,len;
    char str[100];
    cin>>n;
    getchar();
    for (i=0; i<n; i++)
    {
        gets(str);
        len=strlen(str);
        for (j=0; j<len; j++)
            if (str[j]==' ') break;
        strncpy(coun[i].name,str,j);
    }
    sort(coun,coun+n,cmp);
    int t=1;
    for (i=0; i<n; i++)
    {
        if (strcmp(coun[i+1].name,coun[i].name)==0) t++;
        else
        {
            cout<<coun[i].name<<" "<<t<<endl;
            t=1;
        }
    }
    return 0;
}