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.
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.
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.
题目大意是不断的往一个系统里面输入字符串。
如果之前从未输如果则输出OK。
如果之前出现过的话就输出字符串,并且拼接上之前输入过的次数。
这样的就是那个map计数一下就行了。虽然map的复杂度是logn,但是也还是过了,那就这样吧。
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <stack>
#include <map>
#include <queue>
using namespace std;
int main() {
int n;
char tmp[35];
int cnt;
map<string, int> dict;
scanf("%d", &n);
while (n--) {
scanf("%s", tmp);
string name(tmp);
cnt = dict[name];
dict[name] = cnt + 1;
if (cnt == 0) {
printf("OK\n");
continue;
}
printf("%s%d\n", name.c_str(), cnt);
}
return 0;
}