1 solutions
-
0
#include<bits/stdc++.h> using namespace std; int n,ms; map<string,int>m; int main() { cin>>n; for(int i=0;i<n;i++) { string a; cin>>a; m[a]=1; } cin>>ms; for(int i=0;i<ms;i++) { string a; cin>>a; if(m.find(a)==m.end()) cout<<"WRONG\n"; else if(m[a]>1) cout<<"REPEAT\n"; else { m[a]++; cout<<"OK\n"; } } return 0; }
- 1
Information
- ID
- 260
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- 6
- Tags
- # Submissions
- 24
- Accepted
- 10
- Uploaded By