题目链接:http://codeforces.com/problemset/problem/4/C
4C. Registration system
time limit per test5 seconds
memory limit per test64 megabytes
inputstandard input
outputstandard 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 name i 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.
样例
Examples
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
题意:注册名字(name),前面有相同的则对应加上数字(name1,name2,name3…),并输出。
反之,则注册为name,并输出OK
思路:使用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;}