Codeforces--544A--Set of Strings

题目描述：
You are given a string q. A sequence of k strings s1, s2, …, sk is called beautiful, if the concatenation of these strings is string q (formally, s1 + s2 + … + sk = 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 s1, s2, …, sk.

If there are multiple possible answers, print any of them.
输入：
1
abca
2
aaacas
4
abc
输出：
YES
abca
YES
aaa
cas
NO
题意：
给你一个数字k和一个字符串q。请问能否将字符串q分割成k个字符串，必须这k个字符串的首字母不能相同。
题解：
暴力直接搞
代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<i