CodeForces 4C Registration system（字符串处理 | map）

转载请注明出处：http://blog.csdn.net/u012860063

C. Registration systemtime limit per test5 secondsmemory limit per test64 megabytesinputstandard inputoutputstandard 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 namealready 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 toname (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

题意：

如果是第一次出现 则输出ok 如果是第二次出现 先输出字符串 然后再在后面加上n-1

常规思路代码：

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<iostream>
using namespace std;
char a[100047][47],t[47];
int main()
{
int s[100047];
int n ,i,j,k;
while(~scanf("%d",&n))
{
 k = 0;
getchar();
memset(s,0,sizeof(s));
for(i = 0 ; i < n ; i++)
{
gets(t);
for(j = 0 ; j < k ; j++)
{
if(strcmp(t,a[j])==0)
break;
}
if(j == k)
{
strcpy(a[k],t);
s[k++] = 1;
printf("OK\n");
}
else
{
printf("%s%d\n",t,s[j]++);
}
}
}
return 0;
}

map水过代码：不理解map的童鞋请点击：http://blog.csdn.net/u012860063/article/details/24435211

#include<stdio.h>
#include<string.h>
#include<map>
#include<string>
#include<algorithm>
using namespace std;
char s[34];
map<string,int> xxx;
int main()
{
int t,i;
memset(s,0,sizeof(s));
scanf("%d",&t);
getchar();
xxx.clear();
for(i=0;i<t;i++)
{
int flag=0;
scanf("%s",s);
int x=xxx[s];
if(xxx[s]) 
{
printf("%s%d\n",s,x);
}
else
{
printf("OK\n");
}
xxx[s]++;
}
return 0;
}