cf 4c Registration system (map学习）

最新推荐文章于 2023-02-06 17:14:11 发布

原创最新推荐文章于 2023-02-06 17:14:11 发布 · 654 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#acspan idtransmark s

STL 专栏收录该内容

1 篇文章

订阅专栏

本文解析了CodeForces C题“Berlandesk”电子邮件服务注册系统的实现方法，通过使用C++ STL中的map来记录用户名及其出现次数，当用户名已存在时自动递增计数并返回新的用户名。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目链接：http://codeforces.com/problemset/problem/4/C

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 ≤ 10⁵). 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

题意：n个字符串，判断字符串出现了几次，如果之前未出现，输出OK，否则输出字符串+出现次数-1，暴力超时，基本STL，用map

之前对map了解不深，也借这个机会学习一下

发现了一个daloa写的博客，挺全的 http://blog.youkuaiyun.com/callinglove/article/details/8105061

转载到模板了

代码：

#define _CRT_SBCURE_MO_DEPRECATE    
#include<iostream>    
#include<stdlib.h>    
#include<stdio.h>    
#include<cmath>    
#include<algorithm>    
#include<string>    
#include<string.h>    
#include<set>    
#include<queue>    
#include<stack>    
#include<functional>   
#include<map>
using namespace std;
const int maxn = 100000 + 10;
const int INF = 0x3f3f3f3f;

int n;
map<string, int>mp;
string s;

int main() {
	while (scanf("%d", &n) != EOF) {
		for (int i = 0; i < n; i++) {
			getchar();
			cin >> s;
			if (mp[s] == 0) {
				printf("OK\n");
				mp[s]++;
			}
			else {
				cout << s << mp[s] << endl;
				mp[s]++;
			}
		}
	}
	system("pause");
	return 0;
}