I - Misha and Changing Handles CodeForces - 501B
2017-02-08 19:03
393 查看
贼坑,改名字有时间顺序。。
例如
a->b;
c->a;
算两个,用map对应或直接数组都可
例如
a->b;
c->a;
算两个,用map对应或直接数组都可
#include<iostream> #include<set> #include<string> #include<map> #include<sstream> #include<algorithm> using namespace std; string jiu[1010]; string xin[1010]; int main() { int n; while(cin>>n) { int cishu=0,z=0,lala; while(n--) { string str1,str2; cin>>str1>>str2; int jiaohuan=0; for(int i=0;i<cishu;i++) { if(xin[i]==str1) { xin[i]=str2; jiaohuan=1; break; } } if(jiaohuan==0) { jiu[cishu]=str1; xin[cishu]=str2; cishu++; } } cout<<cishu<<endl; for(int i=0;i<cishu;i++) { cout<<jiu[i]<<" "<<xin[i]<<endl; } } }
相关文章推荐
- Misha and Changing Handles CodeForces - 501B(map映射)
- Codeforces Round #285 (Div. 2) ---B. Misha and Changing Handles
- B. Misha and Changing Handles(Codeforces Round 285(div2))
- CodeForces 501B - Misha and Changing Handles
- Codeforces 501B - Misha and Changing Handles (STL)
- 【CodeForces】501B - Misha and Changing Handles(STL - string & vector & pair)
- codeforce285A--Misha and Changing Handles-字符串
- Misha and Changing Handles
- 【codeforces 510 B Misha and Changing Handles】
- Codeforces Round #425 (Div. 2) Problem D Misha, Grisha and Underground (Codeforces 832D) - 树链剖分 - 树状数组
- Codeforces 501B:Misha and Changing Handles(略水+小小技巧)
- Misha and Changing Handles
- 字符串处理 Codeforces Round #285 (Div. 2) B. Misha and Changing Handles
- Codeforces Round #285 (Div.1 B & Div.2 D) Misha and Permutations Summation --二分+树状数组
- codeforces#285 A - Contest + B - Misha and Changing Handles
- Codeforces 501 B - Misha and Changing Handles
- Codeforces Round #285 (Div. 2) C. Misha and Forest
- Codeforces Round #285 (Div. 2) D. Misha and Permutations Summation 康托展开 树状数组+二分
- Codeforces Round #425 (Div. 2) D.Misha, Grisha and Underground
- Codeforces Round #285 (Div. 2) C. Misha and Forest