{"problem":{"name":"Ex - snukesnuke","description":{"content":"Takahashi is going to decide nicknames of $N$ people, person $1,\\ldots,N$. Person $i$ wants a nickname $S_i$. To avoid giving the same nickname to multiple people, he is going to decide their nickname","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc312_h"},"statements":[{"statement_type":"Markdown","content":"Takahashi is going to decide nicknames of $N$ people, person $1,\\ldots,N$.\nPerson $i$ wants a nickname $S_i$. To avoid giving the same nickname to multiple people, he is going to decide their nicknames as follows:\n\n*   For each $i=1,\\ldots,N$ in order, decide person $i$'s nickname as follows:\n    *   Initialize a variable $k_i$ with $1$.\n    *   Repeatedly increment $k_i$ by one while the $k_i$\\-time repetition of $S_i$ is someone's nickname.\n    *   Let person $i$'s nickname be the $k_i$\\-time repetition of $S_i$.\n\nFind $k_1,\\ldots$, and $k_N$ after deciding nicknames of the $N$ people.\n\n## Constraints\n\n*   $N \\geq 1$\n*   $S_i$ is a string of length at least $1$ consisting of lowercase English letters.\n*   The sum of lengths of $S_i$ is at most $2\\times 10^5$.\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$N$\n$S_1$\n$\\vdots$\n$S_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc312_h","tags":[],"sample_group":[["3\nsnuke\nsnuke\nrng","1 2 1\n\n*   First, he decides person $1$'s nickname.\n    *   Let $k_1=1$.\n    *   The $k_1$\\-time repetition of $S_1$ is `snuke`, which is nobody's nickname, so person $1$'s nickname is set to `snuke`.\n*   Next, he decides person $2$'s nickname.\n    *   Let $k_2=1$.\n    *   The $k_2$\\-time repetition of $S_2$ is `snuke`, which is already a nickname of person $1$, so increment $k_2$ by one to make it $2$.\n    *   The $k_2$\\-time repetition of $S_2$ is `snukesnuke`, which is nobody's nickname, so person $2$'s nickname is set to `snukesnuke`.\n*   Finally, he decides person $3$'s nickname.\n    *   Let $k_3=1$.\n    *   The $k_3$\\-time repetition of $S_3$ is `rng`, which is nobody's nickname, so person $3$'s nickname is set to `rng`.\n\nThus, $k_1$, $k_2$, and $k_3$ result in $1$, $2$, and $1$, respectively."],["4\naa\na\na\naaa","1 1 3 2\n\n*   Person $1$'s nickname is set to `aa`.\n*   Person $2$'s nickname is set to `a`.\n*   Person $3$'s nickname is set to `aaa`, because `a` and `aa` are already nicknames of someone else.\n*   Person $4$'s nickname is set to `aaaaaa`, because `aaa` is already a nickname of someone else."],["5\nx\nx\nx\nx\nx","1 2 3 4 5"]],"created_at":"2026-03-03 11:01:14"}}