Codeforces-Solutions/219A_kString.cpp at main · ishaanjav/Codeforces-Solutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
/*
 * Created by ishaanjav
 * github.com/ishaanjav
 * Codeforces Solutions: https://github.com/ishaanjav/Codeforces-Solutions
 */

#include <iostream>
using namespace std;

#define ll long long
#define pb push_back
#define mp make_pair

#include <string>
#include <vector>
//#include <algorithm>
//#include <set>
//#include <map>
//#include <unordered_set>
#include <unordered_map>
//#include <cmath>
//#include <cstring>
//#include <sstream>
//#include <stack>
//#include <queue>

unordered_map<char, int> m;
int main() {
    int n;
    cin >> n;
    string s;
    cin >> s;
    if (s.length() % n != 0) {
        cout << -1 << endl;
    } else {
        int si = s.length() / n;
        for (char c : s) {
            m[c]++;
        }
        bool possible = true;
        string t;
        for (auto p : m) {
            if (p.second % n != 0) possible = false;
            for (int i = 0; i < p.second / n; i++) {
                t += p.first;
            }
        }
        if (!possible)
            cout << -1 << endl;
        else {
            for (int i = 0; i < n; i++)
                cout << t;
            cout << endl;
        }
    }
}