• uva-10420


    List of Conquests

    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


    题目大意:输入一个数字表示有几行。每行输入一个国家,一个人名。输出一共从该国家获得多少战利品,顺序按国家名的字典序。
     1 #include<cstdio>
     2 #include<string.h>
     3 #include<stdlib.h>
     4 
     5 char country[2005][50];
     6 char s[80];
     7 
     8 int cmp(const void*_a,const void*_b)
     9 {
    10     char * a=(char *)_a;
    11     char * b=(char *)_b;
    12     return strcmp(a,b);
    13 }
    14 
    15 int main()
    16 {
    17     int n,i,count;
    18     while(scanf("%d",&n) != EOF)
    19     {
    20         getchar();
    21         for(i=0;i<n;i++)
    22         {
    23             scanf("%s",country[i]);
    24             gets(s);
    25         }
    26         qsort(country,n,sizeof(country[0]),cmp);
    27         count=1;
    28         for(i=1;i<n;i++)
    29         {
    30             if(strcmp(country[i],country[i-1])==0)
    31             {
    32                 count++;
    33             }
    34             if(strcmp(country[i],country[i-1])!=0)
    35             {
    36                 printf("%s ",country[i-1]);
    37                 printf("%d
    ",count);
    38                 count=1;
    39             }
    40             if(i==(n-1))
    41             {
    42                 printf("%s ",country[i]);
    43                 printf("%d
    ",count);
    44             }
    45         }
    46     }
    47     return 0;
    48 }
  • 相关阅读:
    没有 Lambda 演算何来匿名函数——匿名函数(匿名方法和Lambda)、委托、LINQ
    HTML 4.01 符号实体
    利用 IHttpModule 自定义 HTTP 处理模块
    数据结构单链表
    Ext.Net 1.2.0_Ext.Net.RendererFormat 常用数据格式转换呈现格式
    ASP.NET 以 Request.Querystring、Request.Form 或 Request.Params 获取客户端的数据
    Flex>连接WebService
    java.sql.SQLException: 关闭的连接
    jsp>SmartUpload相关类说明
    flex>样式和主题
  • 原文地址:https://www.cnblogs.com/youdiankun/p/3676161.html
Copyright © 2020-2023  润新知