UVA 10420-List of Conquests(STL-map的应用)
来源:互联网 发布:世界ol装备进阶数据 编辑:程序博客网 时间:2024/06/13 05:12
Description
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
小技巧:当用scanf输入字符串的时候不能包含空格,gets输入字符串的时候可以包含空格。
#include <stdio.h>#include <string.h>#include <stdlib.h>#include <iostream>#include <algorithm>#include <map>#include <string>using namespace std;int main(){ int n; char country[110]; char woman[110]; map<string,int >G; map<string,int >::iterator it; scanf("%d",&n); while(n--) { scanf("%s",country); gets(woman); G[country]++; } for(it=G.begin();it!=G.end();it++) { cout<<it->first<<' '<<it->second<<endl; } return 0;}
- UVA 10420-List of Conquests(STL-map的应用)
- UVa 10420 List of Conquests (STL map)
- UVA - 10420 - List of Conquests (排序 - qsort、STL)
- UVa 10420 List of Conquests
- UVA 10420 - List of Conquests
- uva 10420 List of Conquests
- UVA 10420 - List of Conquests
- UVa 10420 - List of Conquests
- UVa 10420 - List of Conquests
- UVa 10420 - List of Conquests
- UVA 10420 - List of Conquests
- UVa 10420 - List of Conquests
- UVA 10420 List of Conquests
- uva 10420 - List of Conquests
- UVa - 10420 - List of Conquests
- uva 10420 List of Conquests
- uva - 10420 - List of Conquests
- UVa 10420 - List of Conquests
- 数据结构JAVA----插入排序
- 使用 Codec Engine 的 API 函数(六)
- Linux内核源文件以及头文件介绍
- 数据结构JAVA---选择排序
- uva 10820 poj 2407 poj 1284 poj 2478 poj 3090 (欧拉函数入门)
- UVA 10420-List of Conquests(STL-map的应用)
- memcache之旅(二)
- php empty()和isset()的区别
- VIM解决中文编码问题
- Xcode6 用企业级账号打包App没有plist文件
- vbs实现unicode和ascii编码转换
- scala 简要: xml处理
- 数据结构JAVA--冒泡排序
- QEMU KVM 提纲