Registration system

最新推荐文章于 2022-02-20 10:53:49 发布

原创最新推荐文章于 2022-02-20 10:53:49 发布 · 654 阅读

2 ·

CC 4.0 BY-SA版权

AC路漫漫专栏收录该内容

180 篇文章

订阅专栏

本文介绍了一个名为“Berlandesk”的邮件服务注册系统的实现原理。当用户尝试使用一个名称进行注册时，如果该名称已存在，则系统会自动为用户提供一个新的用户名（通过在原始用户名后添加数字的方式），确保每个用户的用户名都是唯一的。

Description

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 hisname. If such a name does not exist in the system database, it is inserted into the database, and the user gets the responseOK, confirming the successful registration. If thename already exists in the system database, the system makes up a new user name, sends it to the user as a prompt andalso inserts the prompt into the database. The new name is formed by the following rule. Numbers, starting with 1, are appended one after another toname (name1,name2, ...), among these numbers the leasti is found so that namei does not yet exist in the database.

Input

The first line contains number n (1 ≤ n ≤ 10⁵). The followingn 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.

Sample Input

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

#include<stdio.h>  
#include<string.h>  
char a[100005][35],t[35];  
int main(){  
    int n,s[100005];  
    while(scanf("%d",&n)!=EOF){  
        int f=0,i,j,k=0;  
        getchar();  
        memset(s,0,sizeof(s));  
        for(i=0;i<n;i++){  
            gets(t);  
            for(j=0;j<k;j++)  
                if(strcmp(t,a[j])==0)  
                    break;  
            if(j==k){  
                strcpy(a[k],t);  
                s[k++]=1;  
                printf("OK\n");  
            }  
            else  
                printf("%s%d\n",t,s[j]++);  
        }  
    }  
    return 0;  
}  

换map做更方便

#include<iostream>
#include<map>
using namespace std;
int main()
{
	int n;
	cin>>n;
	string str;
	map<string,int> ma;
	while(n--)
	{
		
		cin>>str;
		if( ma[str]!= 0) {
			cout<<str<<ma[str]<<endl;
			ma[str]++;
		}else{
			cout<<"OK"<<endl;
			ma[str]=0;
			ma[str]++;
		}
	}
	return 0;
}