zoukankan      html  css  js  c++  java
  • codeforces Registration system

     Registration system

    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
    Copy
    4
    abacaba
    acaba
    abacaba
    acab
    output
    Copy
    OK
    OK
    abacaba1
    OK
    input
    Copy
    6
    first
    first
    second
    second
    third
    third
    output
    Copy
    OK
    first1
    OK
    second1
    OK
    third1


    用的map做的。
    #include <bits/stdc++.h>
    using namespace std;
    map<string, int> c;
    int main()
    {
        //ios::sync_with_stdio(false);
        //cin.tie(0);
        c.clear();
        int t,i;
        char s[101];
        scanf("%d ",&t);
        for(i=1;i<=t;i++)
        {
            cin>>s;
            c[s]++;
            auto p=c.find(s);
            if(p->second>1)    cout<<p->first<<p->second-1<<endl;
            else cout<<"OK"<<endl;
        }
        return 0;
    }
    View Code
  • 相关阅读:
    ​综述 | SLAM回环检测方法
    从零开始一起学习SLAM | 用四元数插值来对齐IMU和图像帧
    2019-2020年值得关注的9个AR发展趋势
    计算机视觉方向简介 | 图像拼接
    “人工智能资源对接平台”发布,找人、找技术不再难!
    解决上不了网的特例
    机械键盘简介
    笔记本升级方案
    CSS构造表单
    CSS构造表格
  • 原文地址:https://www.cnblogs.com/wandso/p/10086881.html
Copyright © 2011-2022 走看看