codeforces 855A - Tom Riddle's Diary
2017-09-29 21:41
477 查看
http://codeforces.com/problemset/problem/855/A
给出一个字符串,如果之前出现过,则输出yes否则输出no,用map很简单。
给出一个字符串,如果之前出现过,则输出yes否则输出no,用map很简单。
#include<bits/stdc++.h> using namespace std; int main(){ int n; while(cin>>n) { map <string,int> a; a.clear(); int i; string s; for(i=1;i<=n;i++) { cin>>s; if(a[s]==0){ cout<<"NO"<<endl; a[s]=1; } else cout<<"YES"<<endl; } } return 0; }
相关文章推荐
- 【CF Manthan, Codefest 17 A】Tom Riddle's Diary
- codeforces 855A 模拟
- codeforces 897C. Nephren gives a riddle(DFS)
- 【codeforces 897C】Nephren gives a riddle (递归)
- [Easy]CodeForces - 897C Nephren gives a riddle | dfs + 特判
- codeforces 897C Nephren gives a riddle
- codeforces 897C Nephren gives a riddle 递归
- codeforces Good Bye 2015 C - New Year and Domino
- 【模拟】Codeforces 699B One Bomb
- Restoring Table--CodeForces 245D--位运算
- CodeForces - 244B Undoubtedly Lucky Numbers
- codeforces 755E PolandBall and White-Red graph
- Codeforces 337D Book of Evil【树形Dp】好题~好题~
- CodeForces - 630H Benches (组合数学)
- codeforces 702F 可持久化平衡树
- Codeforces 170C Learning Languages (并查集求连通分支)
- codeforces 340D Bubble Sort Graph(dp,LIS)
- codeforces 733B parade
- codeforces 727E. Games on a CD(双Hash
- Codeforces--630D--Hexagons(规律)