List of Conquests
来源:互联网 发布:迅雷网络诊断 编辑:程序博客网 时间:2024/05/05 09:20
Description
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
题意:给出N个人的国籍和名字,统计每个出现国家的人数
使用map类便于统计,也是本人第一次学习使用.
#include <iostream>
#include <cstdio>
#include <string.h>
#include <cstring>
#include <map>
#include <algorithm>
using namespace std;
const int N=2005;
struct cmp
{
bool operator () (const string a,const string b)
{
return a<b;
}
};
map<string,int,cmp> m;
int main ()
{
int n;
scanf("%d",&n);
string str;
char ch[100];
for (int i=0;i<n;i++)
{
cin>>str;
gets(ch);
m[str]++;
}
map<string,int,cmp>::iterator it;
for (it=m.begin();it!=m.end();it++)
cout<<(*it).first<<" "<<(*it).second<<endl;
return 0;
}
- 10420 - List of Conquests
- 10420 - List of Conquests
- uva10420 - List of Conquests
- 10420 - List of Conquests
- uva_10420-List of Conquests
- 10420 - List of Conquests
- 10420 - List of Conquests
- 10420 - List of Conquests
- UVa10420 List of Conquests
- UVA10420-List of Conquests
- 10420 - List of Conquests
- List of Conquests
- 10420 - List of Conquests
- uva List of Conquests
- UVa_10420 - List of Conquests
- UVA10420 List of Conquests
- 10420 - List of Conquests
- List of Conquests
- Ubuntu12.04安装Java6 JDK6 32位or64位
- U盘装个windows 7 和 CentOS 6.4的 双系统
- 四道经典C语言指针试题
- HibernateDaoSupport的使用
- 黑马程序员_java高级篇JDK1.5的新特性系列Day9
- List of Conquests
- Apache Mahout 开源推荐引擎
- 基于visual Studio2013解决C语言竞赛题之1045打印成绩
- 成绩单
- 《UNIX环境高级编程》笔记--sigaction函数
- hdu4643(暴力枚举+二分法)
- 30天自制操作系统-第九天
- Debugging your program using Valgrind gdbserver and GDB
- nyoj 盗梦空间