CodeForces 4C Registration system 【map】

C. 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 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.

Examples
inputCopy
4
abacaba
acaba
abacaba
acab
output
OK
OK
abacaba1
OK
inputCopy
6
first
first
second
second
third
third
output
OK
first1
OK
second1
OK
third1
思路：给出一个字符串，如果之前没有出现过，那么保存到数据库中输出“OK”，否则就生成新的字符串，并把新的字符串也保存到数据库中，新的字符串的生成规则是在从1开始在原字符串后面标号。
如果把每一个字符串都存下来，并每一次都查找一遍时候有重复的话，太费时了。所以用到了数据结构map。最方便的是可以直接通过mp[s]找到每一个字符串的重复次数。
（对于类似同类但是不同种的物品的次数记录，都可以用map）

#include<iostream>
#include<map>
using namespace std;
string s; 
map<string,int> mp; //mp中的int 用来记录对应的字符串出现的次数 
int main()
{
    int n;
    cin>>n;
    for(int i = 0;i<n;i++)
    {
        cin>>s;
        if(mp[s] == 0)cout<<"OK"<<endl;
        else cout<<s<<mp[s]<<endl;
        mp[s]++;
    }

    return 0;
}