UVa 10420 List of Conquests (STL map)
2013-10-21 08:33
246 查看
10420 - List of Conquests
Time limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=98&page=show_problem&problem=1361
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
巧用++m[c]的性质:当键不在map中时,将创建一个新的键值对。
完整代码:
/*0.016s*/ #include<cstdio> #include<string> #include<map> using namespace std; map<string, int> m; map<string, int>::iterator iter; char str[80], c[80]; int main() { int n; scanf("%d", &n); while (n--) { scanf("%s", c); gets(str); ++m[c]; } for (iter = m.begin(); iter != m.end(); ++iter) printf("%s %d\n", (iter->first).c_str(), iter->second);///用"."会错 return 0; }
相关文章推荐
- 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 (排序 - qsort、STL)
- UVA - 10420 List of Conquests
- UVa-10420-List of Conquests
- UVA - 10420 List of Conquests
- UVA 10420-List of Conquests(STL-map的应用)
- Uva 10420 - List of Conquests(排序水题)
- UVA 10420 List of Conquests
- 对Uva 10420 - List of Conquests的文化补充
- UVA 10420 List of Conquests 战利品列表 简单检索+set
- UVA10420 List of Conquests
- UVA10420 List of Conquests
- UVA 10420 (暑假-排序、检索 -B - List of Conquests)