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

    Description

    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 Input

    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

    题意:

    AC代码:

     1 #include<iostream>
     2 #include<cstdio>
     3 #include<string>
     4 #include<cstring>
     5 
     6 using namespace std;
     7 string str[100010];
     8 int number[100010]={0};
     9 
    10 int em(int k)
    11 {
    12     int i;
    13     for(i=k-1;i>0;i--)
    14     if(str[k]==str[i]){
    15         number[k]=number[i]+1;
    16         cout<<str[k]<<number[k]<<endl;
    17         return -1;
    18     }
    19     return 0;
    20 }
    21 
    22 
    23 int main()
    24 {
    25     int n;
    26     cin>>n;
    27     int i;
    28     for(i=1;i<=n;i++)cin>>str[i];
    29     for(i=1;i<=n;i++){if(em(i)==0)cout<<"OK"<<endl;}
    30     return 0;
    31 }
    View Code
  • 相关阅读:
    g++ 链接静态库命令应该放在最后
    Yahoo 股票数据抓取
    Android使用tcpdump抓包
    警惕rapidxml的陷阱(二):在Android上默认内存池分配数组过大,容易导致栈溢出
    警惕rapidxml的陷阱:添加节点时,请保证变量的生命周期
    union中的成员不能有构造函数
    嵌入式设备上运行AllJoyn注意事项
    alljoyn连接时-fno-rtti选项测试结果
    AllJoyn Bundled Daemon 使用方式研究
    linux连接静态库
  • 原文地址:https://www.cnblogs.com/zhangchengbing/p/3233451.html
Copyright © 2011-2022 走看看