code forces 4C Registration system (map 的简单用法)

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

hkhv

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

阅读量741

点赞数

CC 4.0 BY-SA版权

分类专栏： CF 文章标签： codeforces map STL C++

本文链接：https://blog.youkuaiyun.com/hkh746392783/article/details/50056883

CF 专栏收录该内容

18 篇文章

订阅专栏

本文介绍了一个名为Berlandesk的新电子邮件服务的注册系统实现。该系统通过使用map数据结构来跟踪用户名及其出现次数，当用户尝试注册时，系统会检查用户名是否已被使用，并返回相应的确认消息或提供一个新的用户名建议。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

Sample test(s)

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 如果该字符串之前出现过，那么输出该字符串并且输出出现的次数 ，用map就十分的容易，看我的代码就可以很清楚的看出来

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <map>              //map的头文件
using namespace std;
int main()
{
    int n;
    map<string,int>s;       //定义map  
    string str;
    while (~scanf("%d",&n ) )
    {
        while( n-- )
        {
            cin >> str;
            if (s[str])         //如果该字符串出现过
            {
                cout<<str<<s[str]<<endl;            
            }   
            else                //如果该字符串没出现过 
            {
                cout << "OK" << endl;
            }
            s[str]++;
        }
    }
    return 0;
}