Score : $300$ points

问题描述

对于两个字符串 $A$ 和 $B$，令 $A+B$ 表示按顺序连接的 $A$ 和 $B$。

给定 $N$ 个字符串 $S_1,\ldots,S_N$。按照从 $i=1$ 到 $N$ 的顺序修改并打印它们：

• 如果 $S_1,\ldots,S_{i-1}$ 中没有一个等于 $S_i$，则打印 $S_i$；
• 如果有 $X$ （$X>0$）个 $S_1,\ldots,S_{i-1}$ 等于 $S_i$，则将 $X$ 视为字符串，打印 $S_i+$ ( $+X+$ )。

以上为通义千问 qwen-max 翻译，仅供参考。

Problem Statement

For two strings $A$ and $B$, let $A+B$ denote the concatenation of $A$ and $B$ in this order.

You are given $N$ strings $S_1,\ldots,S_N$. Modify and print them as follows, in the order $i=1, \ldots, N$:

• if none of $S_1,\ldots,S_{i-1}$ is equal to $S_i$, print $S_i$;
• if $X$ $(X>0)$ of $S_1,\ldots,S_{i-1}$ are equal to $S_i$, print $S_i+$ ( $+X+$ ), treating $X$ as a string.

Constraints

• $1 \leq N \leq 2\times 10^5$
• $S_i$ is a string of length between $1$ and $10$ (inclusive) consisting of lowercase English letters.

Input

Input is given from Standard Input in the following format:

$N$

$S_1$

$S_2$

$\vdots$

$S_N$

Output

Print $N$ lines as specified in the Problem Statement.

Sample Input 1

5
newfile
newfile
newfolder
newfile
newfolder

Sample Output 1

newfile
newfile(1)
newfolder
newfile(2)
newfolder(1)

Sample Input 2

11
a
a
a
a
a
a
a
a
a
a
a

Sample Output 2

a
a(1)
a(2)
a(3)
a(4)
a(5)
a(6)
a(7)
a(8)
a(9)
a(10)

update @ 2024/3/10 11:03:38