219A.md (1310B)
1 Source: https://codeforces.com/problemset/problem/219/A 2 3 A. k-String 4 5 time limit per test 6 7 2 seconds 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 stdin 16 17 output 18 19 stdout 20 21 A string is called a *k*-string if it can be represented as *k* concatenated copies of some string. For example, the string "aabaabaabaab" is at the same time a 1-string, a 2-string and a 4-string, but it is not a 3-string, a 5-string, or a 6-string and so on. Obviously any string is a 1-string. 22 23 You are given a string *s*, consisting of lowercase English letters and a positive integer *k*. Your task is to reorder the letters in the string *s* in such a way that the resulting string is a *k*-string. 24 25 Input 26 27 The first input line contains integer *k* (1 ≤ *k* ≤ 1000). The second line contains *s*, all characters in *s* are lowercase English letters. The string length *s* satisfies the inequality 1 ≤ |*s*| ≤ 1000, where |*s*| is the length of string *s*. 28 29 Output 30 31 Rearrange the letters in string *s* in such a way that the result is a *k*-string. Print the result on a single output line. If there are multiple solutions, print any of them. 32 33 If the solution doesn't exist, print "-1" (without quotes). 34 35 Examples 36 37 Input 38 39 ``` 40 2 41 aazz 42 ``` 43 44 Output 45 46 ``` 47 azaz 48 ``` 49 50 Input 51 52 ``` 53 3 54 abcabcabz 55 ``` 56 57 Output 58 59 ``` 60 -1 61 ```