题目链接
题意:一个字符串第一次出现就是ok,否则输出时第几次
//#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<cstring>
#include<set>
#include<map>
#include<string>
#include<cassert>
using namespace std;
#define cl(a,b) memset(a,b,sizeof(a))
#define fastIO ios::sync_with_stdio(false);cin.tie(0);
#define LL long long
#define pb push_back
#define gcd __gcd
#define For(i,j,k) for(int i=(j);i<=k;i++)
#define lowbit(i) (i&(-i))
#define _(x) printf("%d\n",x)
typedef vector<LL> vec;
typedef pair<int,int> PI;
const double EPS = 1e-8;
const int maxn = 1e5+10;
const int inf = 1 << 28;
char str[maxn][35];
int num[maxn];
map<string,int> mp;
int main(){
int n;scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%s", str[i]);
num[i] = mp[str[i]];
mp[str[i]]++;
}
for(int i=0;i<n;i++){
if(!num[i]){
printf("OK\n");
}
else {
printf("%s%d\n",str[i],num[i]);
}
}
return 0;
}