标签：
[2016-01-19][CF][510B]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 47 48 49 50 51 52 53 54 | #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;const int maxn = 1E5 + 10;map<string ,string> mp;map<string ,string > mp2;void change(string str1,string str2){ if(mp2.count(str1) == 0){ mp[str1] = str2; mp2[str2] = str1; }else { mp[ mp2[str1] ] = str2; mp2[str2] = mp2[str1]; }}int main(){ int t; scanf("%d",&t); string str1,str2; while(t--){ cin>>str1>>str2; change(str1,str2); } map<string ,string >::iterator it; cout<<mp.size()<<endl; for(it = mp.begin();it != mp.end();it++) cout<<it->first << " "<<it->second<<endl; return 0;} |
标签：
原文地址：http://www.cnblogs.com/qhy285571052/p/5142871.html
