Codeforces 4C-Registration system(map)

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 ≤ 105). 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

4
abacaba
acaba
abacaba
acab

output

OK
OK
abacaba1
OK

input

6
first
first
second
second
third
third

output

OK
first1
OK
second1
OK
third1

题意：邮箱注册问题，输入n个用户名，对于每一个输入，如果用户名不存在，则将此用户名加入后台数据库中，并返回给用户“OK”,如果该用户名已经存在，则返回“该用户名+以该用户名为前缀注册的个数”；

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <cmath>
#include <map>
using namespace std;
#define LL long long
int main()
{
	ios::sync_with_stdio(false);
	int n;string x;
	while(cin>>n)
	{
		map <string,int> m;
		while(n--)
		{
			cin>>x;
			if(m.find(x)==m.end())
			{
				m[x]=1;
				cout<<"OK"<<endl;
			}
			else
			{
				cout<<x<<m[x]++<<endl;
			}
		}
	}
	return 0;
}