CF544A.Set of Strings

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

You are given a string $q$ . A sequence of $k$ strings $s_{1},s_{2},...,s_{k}$ is called beautiful, if the concatenation of these strings is string $q$ (formally, $s_{1}+s_{2}+...+s_{k}=q$ ) and the first characters of these strings are distinct.

Find any beautiful sequence of strings or determine that the beautiful sequence doesn't exist.

输入格式

The first line contains a positive integer $k$ ( $1<=k<=26$ ) — the number of strings that should be in a beautiful sequence.

The second line contains string $q$ , consisting of lowercase Latin letters. The length of the string is within range from $1$ to $100$ , inclusive.

输出格式

If such sequence doesn't exist, then print in a single line "NO" (without the quotes). Otherwise, print in the first line "YES" (without the quotes) and in the next $k$ lines print the beautiful sequence of strings $s_{1},s_{2},...,s_{k}$ .

If there are multiple possible answers, print any of them.

输入输出样例

输入#1
```
1
abca
```
输出#1
```
YES
abca
```
输入#2
```
2
aaacas
```
输出#2
```
YES
aaa
cas
```
输入#3
```
4
abc
```
输出#3
```
NO
```

说明/提示

In the second sample there are two possible answers: {"aaaca","s"} and {"aaa","cas"} .

首页