codeforces-4C

C. Registration system

time limit per test

5 seconds

memory limit per test

64 megabytes

input

standard input

output

standard 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

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
基本看输入输出就知道这道题要做什么了，要求输入n个字符串，第一次输入输出OK，多次输入就输出该字符串并输出次数。
自己写的程序由于算法复杂度较高，跑不过第十六个测试

#include<iostream>
#include<iomanip>
using namespace std;
int main()
{
    int n, x;
    double avea, sum = 0;
    cin >> n;
    for (int i = 0;i < n;i++)
    {
        cin >> x;
        sum += x;
    }
    avea =  sum / n;
    cout << fixed << setprecision(12) << avea << endl;
    return 0;
}*//*
#include<iostream>
#include<string>
using namespace std;
int main()
{
    string a[10000], trem;
    int b[10000] = { 0 };
    int n, i, j, m=0;
    cin >> n;
    for (i = 0;i < n;i++)
    {
        cin >> trem;
        for (j = 0;j <= m;j++)
        {
            if (a[j] == trem)
            {
                b[j]++;
                cout << a[j] << b[j] << endl;
                break;
            }
        }
        if (j == m + 1)
        {
            a[m] = trem;
            m++;
            cout << "OK" << endl;
        }
    }
    return 0;
}

然后学习了map函数，使用map函数后直接通过

#include<iostream>
#include<map>
#include<string>
using namespace std;

int n;
map<string, int>mp;
string s;

int main()
{
    while(scanf("%d", &n) != EOF)
    {
        for (int i = 0;i < n;i++)
        {
            getchar();
            cin >> s;
            if (mp[s] == 0)
            {
                cout << "OK" << endl;
                mp[s]++;
            }
            else
            {
                cout << s << mp[s] << endl;
                mp[s]++;
            }
        }
    }
    return 0;
}