C. Registration system

time limit per test

5 seconds

memory limit per test

64 megabytes

input

standard input

output

standard output

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.

Input

The first line contains number n (1 ≤ n ≤ 10^{5).
The following n lines contain the requests to the system. Each request is a non-empty line, and consists of not more than 32 characters,
which are all lowercase Latin letters.}

Output

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.

Sample test(s)input

4abacabaacabaabacabaacab

output

OKOKabacaba1OK

input

6firstfirstsecondsecondthirdthird

output

OKfirst1OKsecond1OKthird1

解題說明：這道題其實就是一個hash映射，名字沒有出現過的就添加到映射表中，如果出現過就在對應映射加1，用C++中的map結構實現。

#include<iostream>#include<map>#include<string>using namespace std;int main(){map<string,int> m;string s;int n;cin>>n;while(n--){cin>>s;m[s]++;if(m[s]>1){cout<<s<<m[s]-1<<endl;}else{cout<<"OK"<<endl;}}return 0;}