A new e-mail service "Berlandesk" is going to be opened in Berland in the near future.
The site administration wants to launch their project as soon as possible, that's why they
ask you to help. You're suggested to implement the prototype of site registration system.
The system should work on the following principle.
Each time a new user wants to register, he sends to the system a request with his name.
If such a name does not exist in the system database, it is inserted into the database, and
the user gets the response OK, confirming the successful registration. If the name already
exists in the system database, the system makes up a new user name, sends it to the user
as a prompt and also inserts the prompt into the database. The new name is formed by the
following rule. Numbers, starting with 1, are appended one after another to name (name1,
name2, ...), among these numbers the least i is found so that namei does not yet exist in
the database.
输入 The first line contains number n (1 ≤ n ≤ 105). The following n lines contain the requests to the system. Each request is a non-empty line, and consists of not more than 1000 characters, which are all lowercase Latin letters. 输出 Print n lines, which are system responses to the requests: OK in case of successful registration, or a prompt with a new name, if the requested name is already taken. 样例输入 4 abacaba acaba abacaba acab 样例输出 OK OK abacaba1 OK 来源 爱生活 上传者
TCM_张鹏
#include<iostream> #include<string> #include<cstring> using namespace std; int main(){ int n,l; cin>>n; string str[105]; int a[105]; memset(a,0,sizeof(a));//memset函数只能用来初始化为0和-1 l=0; while(n--) { string temp; cin>>temp; int flag=1; for(int j=0;j<l;j++) { if(temp==str[j]) { flag=0; a[j]++; cout<<temp<<a[j]<<endl; } } if(flag==1) { cout<<"OK"<<endl;//一开始写成了小写的ok 又找了半天错误 str[l++]=temp; } } return 0; } #include<iostream> #include<map> using namespace std; int main() { int n; string str; map<string,int>mymap;//容器 输入数据为字符串，输出数据为整型常量。 cin<<n; while(n--) { cin<<str; if(mymap[str])//检测容器中是否含有，含有返回值为1，否则为0. cout<<str<<mymap[str]<<endl; else cout<<"OK"<<endl; mymap[str]++; } return 0; }
c++map容器介绍
