描述:
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.
样例输入:
4 abacaba acaba abacaba acab
样例输出:
OK OK abacaba1 OK
样例输入:
6 first first second second third third
样例输出:
OK first1 OK second1 OK third1
描述:
在不久的将来,一个新的电子邮件服务"Berlandesk"将在伯兰开通。网站管理部门希望尽快启动他们的项目,这就是为什么他们要求你提供帮助。建议你实现站点注册系统的原型。系统应按照以下原则工作。
每次当一个新用户想要去注册时,他向系统发送一个包含他的名称的请求。如果系统数据库中不存在这样的名称,则会将其插入数据库中,用户会得到OK的响应,确认注册成功。如果该名称已存在于系统数据库中,系统将生成一个新用户名,将其作为提示发送给用户,并将提示插入数据库。新名称由以下规则组成。从1开始的数字被一个接一个地添加到名称上(name1, name2, ...),在这些数字中至少i被找到,因此namei在数据库中也不存在。
输入:
第一行包括数字n(1 ≤ n ≤ 105)。接下来的n行包括系统的回复。每个请求都是没有空格的一行,由不超过32个字符组成,这些字符都是小写拉丁字母。
输出:
输出n行,以下是系统对请求的响应:OK表示注册成功的情况,或者如果请求的名称已被使用,则提示使用新名称。
样例输入:
4 abacaba acaba abacaba acab
样例输出:
OK OK abacaba1 OK
样例输入:
6 first first second second third third
样例输出:
OK first1 OK second1 OK third1
题目地址链接:Problem - C - Codeforces