codeforces-4C-Registration system

---

C. Registration system

---

                time limit per test5 seconds   memory limit per test64 megabytes

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.

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

题目链接：cf 4C

题目思路：mp记录该名字被访问过的次数，如果次数为0，则是第一次被访问输出OK，不然输出该字符串+第几次被访问

以下是代码：

#include <vector>#include <map>#include <set>#include <algorithm>#include <iostream>#include <cstdio>#include <cmath>#include <cstdlib>#include <string>#include <cstring>using namespace std;string s[100010];map <string,int> mp;int main(){    int n;    cin >> n;    for (int i = 0; i < n; i++)    {        cin >> s[i];        if (mp.find(s[i]) == mp.end())        {            printf("OK\n");            mp[s[i]] = 1;        }        else        {            cout << s[i] << mp[s[i]] << endl;            mp[s[i]]++;        }    }     return 0;}