zoukankan      html  css  js  c++  java
  • (用了map) Registration system

    http://acm.hust.edu.cn/vjudge/contest/view.action?cid=93241#problem/C (654123)

    http://codeforces.com/problemset/problem/4/C

    Registration system
    Time Limit:5000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

    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

    #include <cstdio>
    #include <cstring>
    #include <cstdlib>
    #include <iostream>
    #include <map>
    #include <algorithm>
    using namespace std;
    
    #define N 21000
    
    ///我也是醉了,map居然有这么大的好处
    
    int main()
    {
        int n;
    
        while(scanf("%d", &n)!=EOF)
        {
            int i;
            char s[100];
    
            map<string, int>a;
    
            for(i=0; i<n; i++)
            {
                scanf("%s", s);
                if(a[s])
                    printf("%s%d
    ", s, a[s]);
                else
                    printf("OK
    ");
                a[s]++;
            }
        }
        return 0;
    }
    View Code
    勿忘初心
  • 相关阅读:
    Debian / Ubuntu 更新内核并开启 TCP BBR 拥塞控制算法
    axios 常用的几个方法
    doT模板双重循环模板渲染方法
    利用闭包,在不设置全局变量的情况下,完成再次点击退出功能
    技术支持
    隐私政策
    apicloud踩坑集锦
    apicloud运行机制
    apcloud混合式开发app学习笔记
    bootstrap 弹出框 另类运用
  • 原文地址:https://www.cnblogs.com/YY56/p/4850838.html
Copyright © 2011-2022 走看看