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
  • 相关阅读:
    webuploader之大文件分段上传、断点续传
    人民币数字金额转大写金额
    发现个delphi调用vc写的Dll中包括pchar參数报错奇怪现象
    HTML5 CSS3 专题 : 拖放 (Drag and Drop)
    Cts框架解析(6)-任务的运行
    vector draw 试用期结束的 激活方法
    15_Android中任务栈
    Android之——AIDL深入
    FZU 2155 盟国
    十分简洁的手机浏览器 lydiabox
  • 原文地址:https://www.cnblogs.com/wandso/p/10086881.html
Copyright © 2011-2022 走看看