codeforces-4C-C. Registration system( 自己的算法根本没有效率可言,TLE! )

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,然后在接下来的n行中依次输入字符串,如果是第一次出现，输出OK,然后存入这个字符串.

如果已经出现过,那么输出这个字符串+它之前输入的次数......

//本蒟蒻......第16道数据TLE......,算法垃圾.，还有很长的路要走啊！

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main(){
    int n;
    cin>>n;
    int b[100005];                  //用来存储每个账号出现的次数
    memset(b,0,sizeof(b));
    char a[n][40];                //存储字符串
    for(int i=0;i<n;i++) {
        strcpy(a[i],"0");         //把里面所有字符数组初始化为0
    }
    //    for(int i=0;i<n;i++){       //打印所有字符数组
    //        cout<<a[i]<<endl;
    //    }
    char str[50];
    for(int i=0;i<n;i++){
        memset(str,0,sizeof(str));
        cin>>str;
        int flag=1;               //设置标志位,1表示不存在记录,0表示存在记录
        int number=0;             //记录每个账号出现的次数
        for(int j=0;j<i;j++){
            if(strcmp(a[j],str)==0){
                b[j]++;
                number=b[j];
//                cout<<"------------------------------------"<<"j="<<j<<" "<<"b[j]="<<b[j]<<endl;
                flag=0;
                break;
            }
        }
        if(flag){
            cout<<"OK"<<endl;
            strcpy(a[i],str);
        }else{
            cout<<str<<number<<endl;
        }
    }

//        cout<<endl;
//        cout<<endl;

//        for(int i=0;i<n;i++){       //打印所有字符数组
//            cout<<"a["<<i<<"]="<<a[i]<<endl;
//        }
//        cout<<endl;

//        for(int i=0;i<n;i++){
//            cout<<"b["<<i<<"]="<<b[i]<<endl;
//        }

    return 0;
}

//朋友的......

<?php
  fscanf(STDIN,"%d",$n);
  $arr = array();
  $res=array();
  for($i=0;$i<$n;$i++)
  {
    fscanf(STDIN,"%s",$str);
    if(array_key_exists($str,$arr))
    {
      $res[]=$str.$arr[$str];
      $arr[$str]++;

    }
    else {
      $arr[$str]=1;
      $res[]="OK";
    }
  }
  for($i=0;$i<$n;$i++)
    echo $res[$i]."\n";

?>