1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 | #include <vector>#include <list>#include <map>#include <set>#include <deque>#include <queue>#include <stack>#include <bitset>#include <algorithm>#include <functional>#include <numeric>#include <utility>#include <sstream>#include <iostream>#include <iomanip>#include <cstdio>#include <cmath>#include <cstdlib>#include <cctype>#include <string>#include <cstring>#include <cstdio>#include <cmath>#include <cstdlib>#include <ctime>using namespace std;int main(){ int n; scanf("%d",&n); getchar(); map<string,int> mp; set<string> cot; while(n--){ char country[80]; scanf("%s",country); string tmp = country; mp[tmp]++; if(cot.count(tmp) == 0) cot.insert(tmp); gets(country); } set<string>::iterator it; for(it = cot.begin();it != cot.end();it++) cout<<*it<<" "<<mp[*it]<<endl; return 0;} |
原文：http://www.cnblogs.com/qhy285571052/p/5142873.html