zoukankan      html  css  js  c++  java
  • 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
    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

    题解:题意很简单,就是判重
    用map
    #include<cstdio> 
    #include<iostream>
    #include<cstring>
    #include<map> 
    using namespace std;
    string s;
    map<string,int>m;
    int main()
    {
        int t;
        cin>>t;
        while(t--)
        {
            cin>>s;
            m[s]++;
            if(m[s]>1)
            {
                cout<<s<<m[s]-1<<endl;
            }
            else
            cout<<"OK"<<endl;
        }
    
        return 0;
    }
  • 相关阅读:
    数组索引,内容交换
    查找两个等长升序线性表的中位数
    MarkDown使用小结
    java元注解
    LeetCode OJ:Valid Number
    LeetCode OJ:Insert Interval
    关于博客的格式
    9.Hive Metastore Administration
    3.控制hive map reduce个数
    6.capacity scheduler
  • 原文地址:https://www.cnblogs.com/ylrwj/p/10951771.html
Copyright © 2011-2022 走看看