题意：输入一系列字符串，如果之前没出现过则输出OK，如果之前输出过，则输出这个字符串+出现的次数在后面
思路：用map随便搞搞
#include <cstdio>
#include <queue>
#include <cstring>
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <set>
#include <ctime>
#include <cmath>
#include <cctype>
using namespace std;
#define maxn 100000
#define LL long long
int cas=1,T;
int main()
{
int n;
while (scanf("%d",&n)!=EOF)
{
map<string,int>s;
for (int i = 1;i<=n;i++)
{
string s1;
cin >> s1;
if (!s.count(s1))
{
s[s1]++;
puts("OK");
}
else
{
cout << s1 << s[s1]++ << endl;
}
}
}
//freopen("in","r",stdin);
//scanf("%d",&T);
//printf("time=%.3lf",(double)clock()/CLOCKS_PER_SEC);
return 0;
}
Description
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
Input
The first line contains number n (1 ≤ n ≤ 105). The following n
Output
Print n lines, which are system responses to the requests: OK
Sample Input
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
