text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int ara[26];
for (int i = 0; i < 26; i++) {
ara[i] = 0;
}
for (int i = 0, len = s.length(); i < len; i++) {
ara[s[i] - 'a']++;
}
for (int i = 0; i < 26; i++) {
if (ara[i] % n != 0) {
printf("-1");
return 0;
}
ara[i] /= n;
}
for (int k = 0; k < n; k++) {
for (int i = 0; i < 26; i++) {
for (int j = 0; j < ara[i]; j++) {
printf("%c", i + 'a');
}
}
}
printf("\n");
}
|
#include <bits/stdc++.h>
using namespace std;
int k;
int mp[30];
string s;
int main() {
cin >> k >> s;
if (s.size() % k != 0) puts("-1"), exit(0);
for (int i = 0; i < s.size(); i++) mp[s[i] - 'a']++;
for (int i = 0; i < s.size(); i++) {
if (mp[s[i] - 'a'] % k == 0) continue;
puts("-1");
exit(0);
}
string ans = "";
for (int i = 0; i < 26; i++) {
int n = mp[i] / k;
for (int j = 0; j < n; j++) {
ans += 'a' + i;
}
}
for (int i = 0; i < k; i++) cout << ans;
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k = 0;
cin >> k;
string input = "";
cin >> input;
std::sort(input.begin(), input.end());
char run_char = input.at(0);
int count = 1;
string rep_string = "";
bool quit = false;
for (int i = 1; i < input.length(); i++) {
if (input.at(i) == run_char) {
count++;
} else {
if (count % k == 0) {
int num = count / k;
for (int j = 0; j < num; j++) {
rep_string += run_char;
}
count = 1;
run_char = input.at(i);
} else {
cout << -1;
quit = true;
break;
}
}
}
if (!quit) {
if (count % k == 0) {
int num = count / k;
for (int i = 0; i < num; i++) {
rep_string += input.at(input.length() - 1);
}
string k_string = "";
for (int i = 0; i < k; i++) {
k_string += rep_string;
}
cout << k_string;
} else
cout << -1;
}
return 0;
}
|
#include <bits/stdc++.h>
const long long INF = 1 << 28;
using namespace std;
long long POWER(long long base, long long expo) {
long long num = 1;
long long i = expo;
while (i) {
num = num * base;
i--;
}
return num;
}
int main() {
long long t = 1;
while (t--) {
long long k;
cin >> k;
string s;
cin >> s;
long long a[27] = {0};
for (long long i = 0; i < s.length(); i++) a[s[i] - 'a']++;
for (long long i = 0; i <= 26; i++) {
if (a[i] % k != 0) {
cout << -1;
return 0;
}
}
vector<char> v;
for (long long i = 0; i <= 26; i++) {
if (a[i] != 0) {
for (long long j = 1; j <= a[i] / k; j++) {
v.push_back(char(i + 'a'));
}
}
}
for (long long j = 1; j <= k; j++) {
for (long long i = 0; i < v.size(); i++) cout << v[i];
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long n, k;
bool b = true;
char s[1000], s1[1000];
long h = -1;
scanf("%d\n", &k);
scanf("%s", s);
n = strlen(s);
map<char, long> x;
for (int i = 0; i < n; i++) {
x[s[i]]++;
}
for (map<char, long>::iterator i = x.begin(); i != x.end(); i++) {
if ((*i).second % k == 0) {
for (int j = 1; j <= (*i).second / k; j++) {
h++;
s1[h] = (*i).first;
}
} else {
b = false;
}
}
if (b) {
for (int j = 1; j <= k; j++)
for (int i = 0; i <= h; i++) printf("%c", s1[i]);
} else
printf("-1");
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
int main() {
int k;
string s, st;
cin >> k >> s;
map<char, int> m;
set<char> s1;
if (s.length() % k) {
cout << -1;
return 0;
}
for (auto i = 0; i < s.length(); i++) {
if (m.find(s[i]) == m.end())
m.insert({s[i], 1});
else
m[s[i]]++;
s1.insert(s[i]);
}
for (auto i = m.begin(); i != m.end(); ++i) {
if (i->second % k) {
cout << -1;
return 0;
}
}
for (auto i = s1.begin(); i != s1.end(); ++i) {
while (m[*i] != 0) {
st += *i;
m[*i] -= k;
}
}
for (auto i = 0; i < k; i++) cout << st;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, count = 0, q = 0, flag = 0;
char y;
cin >> k;
string str;
cin >> str;
int length = str.size();
char dubli[length];
for (int i = 0; i < length; i++) {
dubli[i] = '#';
}
if (k == 1) {
cout << str;
flag = 1;
} else {
if (length % k == 0) {
int part = length / k;
for (int i = 0; str[i]; i++) {
count = 1;
for (int j = i + 1; str[j]; j++) {
if (str[i] == str[j] && str[i] != '*' && str[i] != '#') {
count = count + 1;
y = str[j];
str[j] = '*';
}
}
if (count % k == 0) {
int p = count / k;
int temp = q;
for (int c = 0; c < k; c++) {
for (int d = 0; d < p; d++) {
dubli[temp + d] = y;
}
temp = temp + part;
}
q = q + p;
} else if (count % k != 0 && str[i] != '*' && str[i] != '#') {
if (flag != 1) cout << "-1";
flag = 1;
break;
}
}
} else {
if (flag != 1) cout << "-1";
flag = 1;
}
}
if (flag != 1) {
for (int i = 0; i < length; i++) {
cout << dubli[i];
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
map<char, int> m;
int k, n;
string str, result = "";
cin >> k;
cin >> str;
n = str.size();
for (int i = 0; i < n; i++) m[str[i]]++;
for (auto it = m.begin(); it != m.end(); it++) {
if (it->second % k != 0) {
cout << -1 << endl;
return 0;
}
int x = it->second / k;
while (x--) {
result += it->first;
}
}
for (int i = 0; i < k; i++) {
cout << result;
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k;
cin >> k;
int flag = 0;
string s;
cin >> s;
int arr[26];
for (int i = 0; i < 26; i++) arr[i] = 0;
for (int i = 0; i < s.length(); i++) ++arr[s[i] - 'a'];
for (int i = 0; i < 26; i++) {
if (arr[i] % k != 0) {
cout << -1;
flag = 1;
break;
}
}
int l1 = 0;
int len = s.length();
int flag2 = 0;
string b = "";
if (!flag) {
for (int j = 0; j < k; j++)
for (int i = 0; i < 26; i++) {
if (arr[i] != 0) {
int m = arr[i] / k;
for (int q = 0; q < m; q++) b += 'a' + i;
}
}
cout << b;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int counter[32];
int k;
string getString() {
for (int i = (0); i < (int)(32); i++)
if (counter[i] % k) return "-1";
string pattern = "";
for (int i = (0); i < (int)(32); i++) {
for (int j = (0); j < (int)(counter[i] / k); j++) {
pattern += (char)('a' + i);
}
}
string res = "";
for (int i = (0); i < (int)(k); i++) res += pattern;
return res;
}
int main() {
memset(counter, 0, sizeof(counter));
cin >> k;
char c;
while (cin >> c) {
counter[c - 'a']++;
}
cout << getString() << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[27];
int main() {
int k;
string s, q = "";
cin >> k >> s;
for (int i = 0; i < s.size(); i++) {
a[s[i] - 'a']++;
}
for (int i = 0; i < 26; i++) {
if (a[i] % k != 0) {
cout << -1;
return 0;
}
for (int j = 1; j <= a[i] / k; j++) {
q += i + 'a';
}
}
for (int i = 1; i <= k; i++) {
cout << q;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int j, n, c = 0, flag = 0;
string s;
cin >> n;
cin >> s;
map<char, int> freq;
for (j = 0; j < s.length(); j++) {
freq[s[j]]++;
}
for (auto i : freq) {
if (i.second % n != 0) {
flag = 1;
break;
}
}
if (flag == 1) {
cout << -1;
} else {
string r = "";
j = 0;
for (auto i : freq) {
while (j < (i.second) / n) {
r = r + i.first;
j++;
}
j = 0;
}
for (int i = 0; i < n; i++) {
cout << r;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void k_string(string s, int k) {
string a;
int h[30] = {0};
for (int i = 0; i < s.length(); i++) {
h[s[i] - 97]++;
}
for (int i = 0; i <= 26; i++) {
if (h[i] % k != 0 && h[i] != 0) {
cout << "-1";
return;
} else {
int x = h[i] / k;
char ch = i + 97;
for (int i = 0; i < x; i++) a.push_back(ch);
}
}
for (int i = 0; i < k; i++) {
cout << a;
}
}
int main() {
int k;
cin >> k;
string s;
string a;
cin >> s;
k_string(s, k);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k;
string s, s1;
cin >> k >> s;
if (s.size() == 1) {
cout << s;
return 0;
}
map<char, int> mymap;
map<char, int>::iterator imap;
for (int i = 0; i < s.size(); i++) {
if (!mymap.count(s[i]))
mymap.insert(pair<char, int>(s[i], 1));
else {
imap = mymap.find(s[i]);
imap->second++;
}
}
for (imap = mymap.begin(); imap != mymap.end(); imap++) {
if (imap->second % k != 0) {
cout << -1;
return 0;
} else {
for (int i = 0; i < imap->second / k; i++) s1 += imap->first;
}
}
for (int i = 0; i < k; i++) cout << s1;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, n, j;
cin >> n;
string s;
cin >> s;
map<int, int> m;
vector<char> v;
for (i = 0; i < s.length(); i = i + 1) {
m[s[i]] = m[s[i]] + 1;
}
for (i = 97; i < 123; i = i + 1) {
if (m[i] % n != 0) {
cout << -1 << endl;
goto label;
} else {
for (j = 0; j < (m[i] / n); j = j + 1) {
v.push_back(char(i));
}
}
}
for (i = 0; i < n; i = i + 1) {
for (auto it = v.begin(); it != v.end(); it++) {
cout << *it;
}
}
label:;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k;
while (cin >> k) {
string s;
cin >> s;
sort(s.begin(), s.end());
string ans;
int cnt = 1, n = s.size();
for (int i = 0; i < n; ++i) {
if (i == n - 1 || s[i] != s[i + 1]) {
if (cnt % k != 0) {
ans = "-1";
break;
} else {
for (int j = 0; j < cnt / k; ++j) {
ans += s[i];
}
cnt = 1;
}
} else {
++cnt;
}
}
if (ans != "-1") {
string t = ans;
for (int i = 1; i < k; ++i) {
ans += t;
}
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int k;
cin >> k;
string s, ans;
cin >> s;
ans = s;
map<char, int> m;
for (auto x : s) m[x]++;
int i = 0;
for (auto x : m)
if (x.second % k != 0) {
cout << -1;
return 0;
} else {
while (m[x.first]) {
for (int j = i; j < s.size(); j += (s.size() / k)) ans[j] = x.first;
m[x.first] -= k;
i++;
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k;
cin >> k;
string s, ans;
cin >> s;
int a[26] = {0};
for (int i = 0; i < s.length(); i++) {
a[s[i] - 'a']++;
}
int t;
for (int i = 0; i < 26; i++) {
if (a[i] % k == 0) {
t = a[i] / k;
while (t--) ans += (i + 'a');
} else {
cout << "-1";
return 0;
}
}
for (int i = 0; i < k; i++) cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long k, i, n, j;
char c;
string s, a;
map<char, long long> m;
cin >> k >> s;
n = s.size();
for (i = 0; i < n; i++) {
m[s[i]]++;
}
for (c = 'a'; c <= 'z'; c++) {
if (m[c] % k) {
c = 'A';
break;
}
for (int j = 0; j < m[c] / k; j++) a += c;
}
if (c == 'A') {
cout << -1;
return 0;
}
for (i = 0; i < k; i++) cout << a;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int k;
string str, ans;
cin >> k >> str;
map<char, int> m;
for (int i = 0; str[i]; ++i) {
m[str[i]]++;
}
for (auto x : m) {
if (x.second % k != 0) {
cout << "-1";
return 0;
}
for (int i = 1; i <= x.second / k; ++i) {
ans += x.first;
}
}
for (int i = 0; i < k; ++i) {
cout << ans;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long arr[10002][9];
int main() {
string ss;
int k, n;
int arr[30];
for (int i = 0; i < 30; i++) arr[i] = 0;
bool cn = false;
cin >> k >> ss;
for (int i = 0; i < ss.length(); i++) arr[ss[i] - 'a']++;
for (int i = 0; i <= 25; i++) {
if (arr[i] % k)
cn = true;
else
arr[i] = arr[i] / k;
}
if (cn)
cout << "-1\n";
else {
string tt = "";
char ch;
for (int i = 0; i <= 25; i++) {
for (int j = 0; j < arr[i]; j++) {
ch = i + 'a';
tt += ch;
}
}
string pp = "";
for (int i = 0; i < k; i++) pp += tt;
cout << pp << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[1007];
int main() {
int n, m, x, y, z = 0;
string s, sr;
memset(a, 0, sizeof a);
vector<char> v;
scanf("%d", &(n));
cin >> s;
for (int(i) = (0); (i) <= (s.length() - 1); (i)++) {
a[(int)s[i] - 96]++;
}
for (int(i) = (1); (i) <= (26); (i)++) {
if (a[i] % n != 0) {
printf("%d", -1);
break;
} else if (a[i] % n == 0 && i == 26) {
while (v.size() != s.length()) {
for (int(j) = (1); (j) <= (26); (j)++) {
for (int(k) = (1); (k) <= (a[j] / n); (k)++) {
if (sr.length() != s.length()) v.push_back((char)j + 96);
}
}
}
for (int(i) = (0); (i) <= (v.size() - 1); (i)++) cout << v[i];
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int n, i, j;
string s;
cin >> n >> s;
long long int a[26];
memset(a, 0, sizeof(a));
for (i = 0; i < s.length(); i++) {
a[s[i] - 'a']++;
}
long long int f = 0;
for (i = 0; i < 26; i++) {
if (a[i] % n != 0) {
cout << -1;
f = 1;
break;
}
}
vector<char> vc;
if (f == 0) {
for (i = 0; i < 26; i++) {
for (j = 0; j < a[i] / n; j++) {
vc.push_back(char(i + 'a'));
}
}
for (i = 0; i < n; i++) {
for (auto k = vc.begin(); k != vc.end(); k++) {
cout << *k;
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, c = 0;
cin >> k;
string s, s1;
cin >> s;
int hash[26] = {0};
for (int i = 0; i < s.size(); i++) {
hash[s[i] - 'a']++;
}
int p;
for (int i = 0; i < 26; i++) {
if (hash[i] != 0 && hash[i] % k == 0) {
p = hash[i] / k;
while (p--) {
s1 += char(i + 'a');
}
} else if (hash[i] != 0 && hash[i] % k != 0)
c++;
}
string s2;
while (k--) {
s2 += s1;
}
if (c)
cout << "-1";
else
cout << s2;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[27];
int main() {
int k;
cin >> k;
string s;
cin >> s;
string c = "";
for (int i = 0; i < s.length(); i++) {
a[s[i] - 'a']++;
}
for (int i = 0; i < 26; i++) {
if (a[i] != 0) {
if (a[i] % k != 0) {
cout << "-1";
return 0;
} else {
int t = a[i] / k;
while (t) {
char r = i + 97;
c += r;
t--;
}
}
}
}
while (k) {
cout << c;
k--;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int v[26];
int main() {
int n;
int i;
int j;
scanf("%d", &n);
char s[1005];
getchar();
gets(s);
char t[30];
memset(v, 0, sizeof(v));
int len = strlen(s);
if (len % n != 0)
cout << -1 << endl;
else {
for (i = 0; i < len; i++) {
v[s[i] - 'a']++;
}
for (i = 0; i < 26; i++) {
if (v[i] % n != 0) break;
}
int pp = n;
int kk;
if (i == 26) {
while (pp--) {
for (i = 0; i < 26; i++) {
if (v[i] != 0) {
kk = v[i] / n;
while (kk--) printf("%c", i + 'a');
}
}
}
cout << endl;
} else
cout << -1 << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, n, i, arr[27];
char s[1001];
cin >> k;
cin >> s;
n = strlen(s);
for (i = 0; i <= 26; i++) arr[i] = 0;
for (i = 0; i < n; i++) arr[s[i] - 'a']++;
for (i = 0; i < 26; i++)
if (arr[i] % k) {
cout << -1 << endl;
return 0;
}
int j, ki = 0;
for (i = 0; i < 26; i++) {
for (j = 0; j < (arr[i] / k); j++) s[ki++] = 'a' + i;
}
s[ki] = '\0';
for (i = 0; i < k; i++) cout << s;
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int alpha[28];
int main() {
int k;
memset(alpha, 0, sizeof(alpha));
string s;
cin >> k;
cin >> s;
for (int i = 0; s[i]; i++) {
alpha[s[i] - 'a']++;
}
string tex = "";
for (int i = 0; i < 28; i++) {
if (alpha[i] % k != 0 && alpha[i] != 0) {
cout << -1;
return 0;
}
if (alpha[i] % k == 0) {
for (int j = 0; j < alpha[i] / k; j++) tex += i + 'a';
}
}
for (int i = 0; i < k; i++) cout << tex;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int k;
cin >> k;
string s;
cin >> s;
vector<long long> freq(26, 0);
for (int i = 0; i < s.length(); i++) {
freq[s[i] - 'a']++;
}
string ans = "";
for (int i = 0; i < 26; i++) {
if (freq[i] % k != 0) {
cout << -1;
return 0;
}
for (int j = 1; j <= (freq[i] / k); j++) ans += ('a' + i);
}
string f_ans = ans;
for (int i = 2; i <= k; i++) f_ans += ans;
cout << f_ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int c = 220000;
int main() {
int a[300], k;
string second;
cin >> k >> second;
memset(a, 0, sizeof(a));
for (int i = 0; i < second.size(); i++) a[second[i] - 'a']++;
bool p = 1;
for (int i = 0; i <= 'z' - 'a'; i++)
if (a[i] % k != 0) p = 0;
if (p)
for (int i = 0; i < k; i++)
for (int j = 0; j <= 'z' - 'a'; j++)
for (int u = 0; u < a[j] / k; u++) cout << char('a' + j);
else
cout << -1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<char, int> mp;
int main() {
bool f = 1;
int k, l;
char ch[10000];
scanf("%d%s", &k, ch);
string s = ch, ans = "";
l = s.size();
for (int i = 0; i < l; i++) mp[s[i]]++;
for (auto x : mp) {
if (x.second % k != 0) f = 0;
for (int i = 0; i < x.second / k; i++) ans += x.first;
}
if (!f)
printf("-1");
else
for (int i = 0; i < k; i++) printf("%s", ans.c_str());
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, f = 0;
cin >> n;
string s, ga = "";
cin >> s;
unordered_map<char, long long int> map;
for (long long int i = 0; i < s.length(); i++) map[s[i]]++;
for (auto &x : map) {
if (x.second % n != 0) {
cout << "-1";
f = 0;
break;
} else {
int no = x.second / n;
while (no--) ga += x.first;
f = 1;
}
}
if (f == 1) {
while (n--) cout << ga;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k;
string x;
cin >> k >> x;
sort(x.begin(), x.end());
int a[26];
for (int i = 0; i < 26; i++) a[i] = 0;
for (int i = 0; i < x.length(); i++) a[x[i] - 97]++;
for (int i = 0; i < 26; i++) {
if (a[i] % k != 0) {
cout << -1;
return 0;
}
}
for (int i = 0; i < k; i++)
for (int j = 0; j < 26; j++)
for (int c = 0; c < a[j] / k; c++) cout << (char)(j + 97);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O0")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("-ffloat-store")
void get(long long arr[], long long n) {
for (long long i = 0; i < n; i++) cin >> arr[i];
}
long long gcd(long long a, long long b);
long long binpow(long long a, long long b);
void solve() {
long long k;
cin >> k;
string x;
cin >> x;
long long n = x.length();
map<long long, long long> m;
if (n % k != 0) {
cout << "-1";
return;
}
set<char> s;
for (int i = 0; i < n; i++) {
s.insert(x[i]);
m[x[i]]++;
}
bool f = true;
for (auto &y : s) {
if ((m[y]) % k != 0) f = false;
if (!f) break;
}
if (!f) {
cout << "-1";
return;
}
string ans = "";
for (auto &y : s) {
long long add = m[y] / k;
for (int i = 0; i < add; i++) ans += y;
}
string fans = "";
for (int i = 0; i < k; i++) fans += ans;
cout << fans;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t;
t = 1;
while (t--) {
solve();
}
}
long long binpow(long long a, long long b) {
long long res = 1;
while (b > 0) {
if (b & 1) res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k;
string s;
map<char, int> m1;
cin >> k >> s;
int n = s.length();
for (int i = 0; i < n; i++) {
m1[s[i]]++;
}
map<char, int>::iterator it;
int flag = 0;
for (it = m1.begin(); it != m1.end(); it++) {
if ((it->second) % k) {
flag = 1;
break;
}
}
if (flag) {
cout << "-1";
} else {
it = m1.begin();
int val = k;
string s1 = "";
for (it = m1.begin(); it != m1.end(); it++) {
int num = (it->second) / k;
while (num--) s1 += it->first;
}
while (k--) cout << s1;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string a, b, c;
cin >> n >> a;
sort(a.begin(), a.end());
for (int i = 0; i < a.size(); i += n) b += a[i];
for (int i = 0; i < n; i++) c += b;
b = c;
sort(b.begin(), b.end());
if (b != a)
cout << -1;
else
cout << c;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int arr[26];
memset(arr, 0, sizeof(arr));
int k;
string s, alpha = "abcdefghijklmnopqrstuvwxyz";
string res = "";
cin >> k >> s;
for (int i = 0; i < s.size(); i++) {
arr[s[i] - 'a']++;
}
for (int i = 0; i < alpha.size(); i++) {
char c = alpha[i];
if (arr[c - 'a'] % k) {
cout << -1;
return 0;
}
for (int j = 0; j < arr[c - 'a'] / k; j++) {
res += c;
}
}
for (int i = 0; i < k; i++) cout << res;
}
|
#include <bits/stdc++.h>
using namespace std;
set<char> ans;
int n;
string s, t;
int a[27];
int main() {
cin >> n >> s;
for (int i = 0; i < s.size(); i++) {
a[s[i] - 'a']++;
}
for (int i = 0; i < 26; i++) {
if (a[i] % n != 0) {
cout << -1;
exit(0);
} else {
for (int j = 0; j < a[i] / n; j++) {
t += char(i + 'a');
}
}
}
for (int i = 0; i < n; i++) cout << t;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
void solve() {}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
int k;
cin >> k;
string A;
cin >> A;
int arr[26] = {0}, n = A.size();
for (int i = 0; i < n; ++i) {
++arr[A[i] - 'a'];
}
for (int i = 0; i < 26; ++i) {
if (arr[i] % k) {
cout << -1 << "\n";
return 0;
}
}
string S = "";
int rem = 0;
for (int i = 0; i < 26; ++i) {
rem = arr[i] / k;
for (int j = 0; j < rem; ++j) {
S += (char('a' + i));
}
}
for (int i = 0; i < k; ++i) {
cout << S;
}
cout << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int k, mark[40];
string s, s1;
int main() {
cin >> k >> s;
for (int i = 0; i < s.size(); i++) mark[(int)s[i] - 'a']++;
for (int i = 0; i < 26; i++) {
if (mark[i] % k != 0) return cout << -1, 0;
if (mark[i] > 0)
for (int j = 0; j < (mark[i] / k); j++) s1 += (char)i + 'a';
}
for (int i = 0; i < k; i++) cout << s1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, l, count = 0;
char ch;
string s;
cin >> k;
cin >> s;
l = s.size();
sort(s.begin(), s.begin() + s.size());
for (int i = 0; i < s.size(); i++) {
if (i % k == 0) {
ch = s[i];
}
if (s[i] == ch) {
count++;
}
}
if (l == count && count % k == 0) {
for (int i = 0; i < k; i++) {
for (int j = 0; j < s.size(); j += k) {
cout << s[j];
}
}
} else {
cout << "-1";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k;
string s;
cin >> k >> s;
if (k == 1) {
cout << s << endl;
return 0;
} else if (s.size() % k != 0) {
cout << -1 << endl;
return 0;
}
int arr[26];
memset(arr, 0, sizeof(arr));
for (int i = 0; i < s.size(); i++) arr[s[i] - 'a']++;
bool cond = true;
string newS = "";
for (int i = 0; i < 26 && cond; i++) {
if (arr[i] % k) cond = false;
for (int counter = 0; counter < arr[i] / k; counter++) newS += 'a' + i;
}
if (!cond)
cout << -1 << endl;
else {
string ToPrint = "";
for (int counter = 0; counter < k; counter++) ToPrint += newS;
cout << ToPrint << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct node {
int x;
int y;
};
int Max(int x, int y) { return x > y ? x : y; }
int Min(int x, int y) { return x < y ? x : y; }
int cmp(const void *a, const void *b) { return *(int *)a - *(int *)b; }
queue<int> Q;
stack<int> S;
int n, m;
int res, tmp;
char s[1005];
int a[30];
int main() {
int i, j;
while (scanf("%d", &n) != EOF) {
scanf("%s", s);
int len = strlen(s);
memset(a, 0, sizeof(a));
for (i = 0; i < len; ++i) {
a[s[i] - 'a']++;
}
bool flag = true;
for (i = 0; i < 26; ++i)
if (a[i] % n) flag = false;
if (!flag)
puts("-1");
else {
int k;
for (k = 1; k <= n; ++k) {
for (i = 0; i < 26; ++i)
for (j = 0; j < a[i] / n; ++j) printf("%c", i + 'a');
}
printf("\n");
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, j = 0;
string str;
cin >> k >> str;
sort(str.begin(), str.end());
string tmp, ans1;
for (int i = 0; i < str.size() / k; i++) {
tmp += str[j];
j += k;
}
for (int i = 0; i < k; i++) ans1 += tmp;
string ans2 = ans1;
sort(ans2.begin(), ans2.end());
(ans2 == str) ? cout << ans1 : cout << -1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int n;
int main() {
cin >> n >> s;
vector<int> v(26);
for (auto x : s) v[x - 'a']++;
for (auto x : v)
if (x && (x < n || x % n)) {
cout << "-1\n";
return 0;
}
string x = "";
for (int i = 0; i < 26; ++i)
for (int j = 0, d = v[i] / n; j < d; ++j) x += i + 'a';
for (int i = 0; i < n; ++i) cout << x;
cout << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, l, i, f = 0, j;
char c;
string s;
cin >> k >> s;
sort(s.begin(), s.end());
l = s.length();
for (i = 0; i < l; i++) {
if (i % k == 0) {
c = s[i];
}
if (c == s[i]) {
f++;
}
}
if (f == l && f % k == 0) {
for (i = 0; i < k; i++) {
for (j = 0; j < l; j += k) {
cout << s[j];
}
}
cout << endl;
} else {
cout << "-1" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k;
cin >> k;
string s1;
cin >> s1;
std::vector<int> v(26, 0);
for (int i = 0; i < s1.length(); i++) {
v[s1[i] - 97]++;
}
bool flag = false;
for (int i = 0; i < 26; i++) {
if (v[i] % k != 0) {
flag = true;
break;
}
}
if (flag) {
cout << "-1";
} else {
for (int i = 0; i < k; i++) {
for (int j = 0; j < 26; j++) {
if (v[j] != 0) {
for (int l = 0; l < v[j] / k; l++) {
cout << char(97 + j);
}
}
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int k, a[1012];
string s, r;
string operator*(string s, int n) {
string cs = s;
while (--n) s += cs;
return s;
}
int main() {
cin >> k >> s;
for (int i = 0; i < s.length(); i++) a[s[i]]++;
for (int i = 'a'; i <= 'z'; i++)
if (a[i] % k) {
cout << -1 << endl;
return 0;
} else
r.insert(r.length(), a[i] /= k, char(i));
cout << r * k << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T gcd(T a, T b) {
if (!b) return a;
return gcd(b, a % b);
}
template <typename T>
T lcm(T a, T b) {
return a * b / gcd(a, b);
}
int i, k, ct[26];
string s, ans = "";
int main(void) {
cin >> k >> s;
memset(ct, 0, sizeof(ct));
for (i = 0; i < (s.size()); i++) ct[s[i] - 'a'] += 1;
bool ok = s.size() % k == 0;
for (i = 0; i < (26); i++) {
if (ct[i] != 0 && ct[i] % k != 0) {
ok = false;
break;
} else if (ct[i] != 0 && ct[i] % k == 0) {
for (int j = 0; j < ct[i] / k; j++) {
ans += 'a' + i;
}
}
}
if (ok) {
for (i = 0; i < (k); i++) {
cout << ans;
}
cout << "\n";
} else {
cout << -1 << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
char s[1001];
int freq[26] = {};
int i, j, k, l, z;
scanf("%d%s", &k, s);
l = strlen(s);
for (i = 0; i < l; i++) {
int b = s[i] - 'a';
freq[b]++;
}
for (i = 0; i < 26; i++) {
if ((freq[i] % k) != 0) {
printf("-1");
return 0;
}
}
for (i = 0; i < 26; i++) {
if (freq[i]) freq[i] = freq[i] / k;
}
for (z = 0; z < k; z++) {
for (i = 0; i < 26; i++) {
if (!freq[i]) continue;
for (j = 0; j < freq[i]; j++) putchar('a' + i);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, freq[27];
string s;
for (int i = 0; i < 27; i++) freq[i] = 0;
cin >> k;
cin >> s;
for (int i = 0; i < s.length(); i++) freq[s[i] - 'a']++;
for (int i = 0; i < 27; i++) {
if (freq[i] % k) {
cout << -1;
goto end;
}
}
for (int i = 0; i < k; i++) {
for (int j = 0; j < 27; j++) {
for (int l = 0; l < freq[j] / k; l++) {
cout << char(j + 'a');
}
}
}
end:
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[26];
int main() {
int k;
cin >> k;
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) a[s[i] - 'a']++;
bool poss = true;
for (int i = 0; i < 26; i++) {
if (a[i] % k != 0) {
poss = false;
break;
}
}
if (poss) {
for (int i = 0; i < k; i++)
for (int j = 0; j < 26; j++)
if (a[j] != 0)
for (int q = 0; q < a[j] / k; q++) cout << (char)(j + 'a');
cout << endl;
} else
cout << "-1" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, a[123] = {0}, b;
cin >> n;
string s;
cin >> s;
for (i = 0; i < s.size(); i++) a[int(s[i])]++;
for (i = 97; i < 123; i++) {
if (a[i] % n != 0) {
cout << -1;
return 0;
}
a[i] = a[i] / n;
}
int t = n;
while (t--) {
for (i = 97; i < 123; i++) {
for (b = 0; b < a[i]; b++) cout << (char)i;
}
}
}
|
#include <bits/stdc++.h>
int main() {
int k, c = 0;
std ::cin >> k;
std ::string s;
std ::cin >> s;
std ::sort(s.begin(), s.end());
std ::vector<int> v;
std ::vector<char> v1, v2;
for (int i = 0; i < s.length(); ++i) {
c++;
if (s[i] != s[i + 1] || i == s.length() - 1) {
if (c % k != 0) {
std ::cout << -1;
return 0;
} else {
v.push_back(c / k);
c = 0;
}
}
}
for (int i = 0; i < s.size(); ++i) {
if (s[i] == s[i + 1]) {
s.erase(i + 1, 1);
i--;
}
}
for (int i = 0; i < s.size(); ++i) {
v1.push_back(s[i]);
}
for (int i = 0; i < v1.size(); ++i) {
for (int j = 0; j < v[i]; ++j) {
v2.push_back(v1[i]);
}
}
while (k--) {
for (int i = 0; i < v2.size(); ++i) {
std ::cout << v2[i];
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k;
cin >> k;
string str;
cin >> str;
string ans;
int count[26];
for (int i = 0; i < 26; i++) {
count[i] = 0;
}
int j = 0;
for (j = 0; j < str.length(); j++) {
count[str[j] - 'a']++;
}
for (int i = 0; i < 26; i++) {
if (count[i] % k != 0) {
cout << "-1";
return 0;
}
}
for (int i = 0; i < 26; i++) {
if (count[i] != 0) {
char ch = i + 'a';
for (int u = 1; u <= count[i] / k; u++) ans = ans + ch;
}
}
for (int h = 1; h <= k; h++) cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
map<char, int> a;
int n;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
a[s[i]]++;
}
string ans;
int x = 1;
for (auto it : a) {
if (it.second % n != 0) {
cout << -1;
return 0;
}
}
string p = "";
sort(s.begin(), s.end());
for (int i = 0; i < s.size(); i++) {
if ((i + 1) % n == 0) p += s[i];
}
for (int i = 0; i < n; i++) cout << p;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, i;
string s;
string out = "";
int count[26] = {0};
cin >> k;
cin >> s;
for (i = 0; i < s.size(); i++) count[s[i] - 'a']++;
for (i = 0; i < 26; i++)
if (count[i] && count[i] % k) {
cout << -1 << endl;
return 0;
} else if (count[i]) {
int t = count[i] / k;
while (t--) out.push_back(i + 'a');
}
while (k--) cout << out;
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int k, alph[26] = {};
string s;
cin >> k >> s;
int sz = s.size();
for (int i = 0; i < sz; i++) alph[s[i] - 'a']++;
bool f = true;
for (int i = 0; i < 26; i++)
if (alph[i] % k != 0) f = false;
if (f) {
for (int i = 0; i < k; i++)
for (int j = 0; j < 26; j++) {
int x = alph[j] / k;
for (int m = 0; m < x; m++)
if (alph[j] > 0) cout << char('a' + j);
}
} else
cout << "-1";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k;
cin >> k;
string s;
cin >> s;
string res = "";
int f[26] = {0};
for (int i = 0; i < s.size(); i++) {
f[s[i] - 'a']++;
}
int i;
for (i = 0; i < 26; i++)
if ((f[i] % k)) break;
if (i < 26) {
cout << "-1" << endl;
return 0;
}
for (int i = 0; i < 26; i++) {
for (int j = 0; j < (f[i] / k); j++) {
res += i + 'a';
}
}
for (int i = 0; i < k; i++) cout << res;
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
int k;
string s;
int c[26];
int main() {
memset(c, 0, sizeof(c));
cin >> k >> s;
for (int i = 0; i < (int)(s.size()); ++i) {
c[s[i] - 'a']++;
}
for (int i = 0; i < (int)(26); ++i) {
if (c[i] % k != 0) {
cout << -1 << endl;
return 0;
}
}
for (int i = 0; i < (int)(26); ++i) {
c[i] /= k;
}
for (int ct = 0; ct < (int)(k); ++ct) {
for (int i = 0; i < (int)(26); ++i) {
for (int j = 0; j < (int)(c[i]); ++j) {
putchar('a' + i);
}
}
}
putchar('\n');
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1005;
char s[maxn];
int cnt[26];
int main() {
int i, j, k;
scanf("%d", &k);
scanf("%s", s);
memset(cnt, 0, sizeof(cnt));
for (i = 0; s[i]; ++i) ++cnt[s[i] - 'a'];
int len = i;
bool flag = (len % k == 0);
if (flag) {
int l = len / k;
for (i = 0; flag && i < 26; ++i) flag = (cnt[i] % k == 0);
if (flag) {
int b = 0, n;
for (i = 0; i < 26; ++i) {
if (cnt[i]) {
n = cnt[i] / k;
while (n--) {
for (j = b; j < len; j += l) s[j] = i + 'a';
++b;
}
}
}
}
}
if (flag)
puts(s);
else
puts("-1");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k;
cin >> k;
string f;
cin >> f;
map<char, int> car;
for (auto ra : f) {
car[ra]++;
}
string sal = "";
for (auto w : car) {
if (w.second % k != 0) {
cout << -1 << endl;
return 0;
} else {
for (int i = 0; i < w.second / k; i++) {
sal += w.first;
}
}
}
string q = sal;
for (int i = 0; i < k - 1; i++) {
sal += q;
}
cout << sal << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long power(long long x, long long y, long long p) {
long long res = 1;
x = x % p;
while (y > 0) {
if (y & 1) res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
void solve() {
long long k, n, i;
cin >> k;
string s;
cin >> s;
n = s.length();
if (k > n) {
cout << -1;
return;
}
map<char, long long> m;
for (auto c : s) m[c]++;
string ans;
for (auto val : m) {
if (val.second % k) {
cout << -1;
return;
} else
ans.append(val.second / k, val.first);
}
for (i = 1; i <= k; i++) cout << ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long t;
t = 1;
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
const int N = 1000005;
class cmp {
public:
bool operator()(pair<long long, pair<long long, long long> > &A,
pair<long long, pair<long long, long long> > &B) {
return A > B;
}
};
bool by_sec(pair<long long, long long> &A, pair<long long, long long> &B) {
return A.second < B.second;
}
bool is(pair<long long, long long> a, pair<long long, long long> b) {
return !((a.first > b.second && a.second > b.second) ||
(a.first < b.first && a.second < b.first));
}
long double dist(pair<long long, long long> p1, pair<long long, long long> p2) {
return (long double)sqrt(
(long double)(p1.first - p2.first) * (p1.first - p2.first) +
(long double)(p1.second - p2.second) * (p1.second - p2.second));
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s, ans;
long long k;
cin >> k;
cin >> s;
vector<long long> v(30, 0);
for (int i = 0; i < s.size(); i++) v[s[i] - 'a']++;
for (char i = 'a'; i <= 'z'; i++)
if (v[i - 'a'] % k != 0)
return cout << -1, 0;
else
v[i - 'a'] /= k;
for (char i = 'a'; i <= 'z'; i++)
for (int j = 0; j < v[i - 'a']; j++) ans += i;
for (int i = 0; i < s.size() / ans.size(); i++) cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int b[111111];
long long int n, k, d, a[111111], sum, mx = 1, cnt = 1;
long long int vis[111111], lev[11111];
vector<vector<long long int>> v(111111);
map<string, vector<string>>::iterator it;
map<long long int, long long int> mp;
void dfs(long long int s) {
lev[1] = 1;
vis[s] = 1;
for (int i = 0; i < v[s].size(); i++) {
if (!vis[v[s][i]]) {
cnt *= 2;
dfs(v[s][i]);
}
}
}
int main() {
char c;
string s, r[111];
long long int m, j = 0, k = 0, y, x, z, i, u = 0, d = 0, l = 0, x3 = 0;
cin >> n;
cin >> s;
for (i = 0; i < s.length(); i++) {
mp[s[i]]++;
}
for (c = 'a'; c <= 'z'; c++) {
if (mp[c] % n != 0) {
cout << -1;
return 0;
}
}
for (i = n; i > 0; i--) {
for (c = 'a'; c <= 'z'; c++) {
for (j = 0; j < mp[c] / i; j++) cout << c;
mp[c] -= mp[c] / i;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, n, i, fl = 0;
scanf("%d", &k);
string st, res = "";
cin >> st;
n = st.size();
int ar[1000] = {0};
for (i = 0; i < n; i++) {
ar[st[i] - 'a']++;
}
for (i = 0; i < 26; i++) {
if (ar[i] % k != 0 && ar[i] > 0) {
fl = 1;
break;
}
}
if (fl == 1) {
printf("-1\n");
return 0;
}
while (k > 0) {
for (i = 0; i < 26; i++) {
int t = ar[i] / k;
for (int j = 0; j < t; j++) {
res += (i + 'a');
ar[i]--;
}
}
k--;
}
cout << res << endl;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:64000000")
using namespace std;
int gcd(int a, int b) {
while (b) {
a %= b;
if (b > a) swap(a, b);
}
return a;
}
int main() {
string s, ans;
int k;
cin >> k >> s;
map<char, int> m;
for (int i = 0; i < s.length(); i++) m[s[i]]++;
for (map<char, int>::iterator it = m.begin(); it != m.end(); it++)
if (it->second % k != 0) {
cout << "-1";
return 0;
}
for (int ki = 0; ki < k; ki++) {
for (map<char, int>::iterator it = m.begin(); it != m.end(); it++)
for (int i = 0; i < it->second / k; i++) cout << it->first;
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int k, i, j, len, count[30] = {0};
char str[1005];
scanf("%d", &k);
getchar();
gets(str);
len = strlen(str);
if (k == 1)
puts(str);
else if (len % k)
puts("-1");
else {
for (i = 0; i < len; i++) count[(str[i] - 97)]++;
for (i = 0; i < 26; i++) {
if (count[i] && (count[i] % k)) {
puts("-1");
return 0;
}
}
for (j = 0; j < k; j++) {
for (i = 0; i < 26; i++) {
int rep = count[i] / k;
while (rep--) putchar(i + 97);
}
}
putchar('\n');
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int k;
char str[1005];
int ct[30];
char a[1005];
int main() {
while (~scanf("%d", &k)) {
scanf("%s", str);
int len = strlen(str);
memset(ct, 0, sizeof(ct));
for (int i = 0; i < len; i++) {
ct[str[i] - 'a']++;
}
int flag = 0;
for (int i = 0; i < 26; i++)
if (ct[i] % k != 0) flag = 1;
if (flag) {
puts("-1");
continue;
}
int now = 0;
for (int i = 0; i < 26; i++) {
int kk = ct[i] / k;
for (int j = 0; j < kk; j++) a[now++] = i + 'a';
}
a[now] = '\0';
for (int i = 0; i < k; i++) printf("%s", a);
puts("");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k;
cin >> k;
string s;
cin >> s;
map<char, int> mp;
for (int i = 0; i < s.size(); i++) {
mp[s[i]]++;
}
bool b = true;
string res = "";
for (map<char, int>::iterator it = mp.begin(); it != mp.end(); it++) {
if ((*it).second % k != 0) {
b = false;
break;
} else
for (int j = 0; j < (*it).second / k; j++) res += (*it).first;
}
if (b) {
for (int i = 0; i < k; i++) cout << res;
cout << endl;
} else
cout << -1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[30], sz;
int main() {
int k, cnt = 0;
string s, s1;
cin >> k >> s;
sz = s.size();
for (int i = 0; i < sz; i++) a[s[i] - 'a']++;
for (int i = 0; i < 30; i++)
if (a[i] % k != 0) return cout << "-1", 0;
for (int i = 0; i < 30; i++)
if (a[i] > 0)
for (int j = 0; j < a[i] / k; j++) s1 += i + 'a';
for (int i = 0; i < k; i++) cout << s1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int Maxn = 1e3 + 7;
int k, t[30];
string s, sout;
int main() {
cin >> k >> s;
int l = s.length();
for (int i = 0; i < l; i++) {
t[(int)s[i] - 'a']++;
}
for (int i = 0; i < 26; i++) {
if (t[i] % k != 0) {
cout << -1;
return 0;
}
for (int j = 0; j < t[i] / k; j++) sout += char(i + 'a');
}
for (int i = 0; i < k; i++) cout << sout;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string a, b, c;
int n;
cin >> n >> a;
sort(a.begin(), a.end());
for (int i = 0; i < a.size(); i += n) b += a[i];
for (int i = 0; i < n; i++) c += b;
b = c;
sort(b.begin(), b.end());
if (b != a)
cout << -1;
else
cout << c;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
T GCD(T a, T b) {
return (b != 0 ? GCD<T>(b, a % b) : a);
}
template <class T>
T LCM(T a, T b) {
return ((a * b) / GCD<T>(a, b));
}
int main() {
int k;
string s, ans = "", res = "";
cin >> k >> s;
int l = s.size(), f, cnt;
if (l % k) cout << -1 << endl, exit(0);
map<char, int> mp;
for (int i = 0; i < l; i++) mp[s[i]]++;
map<char, int>::iterator it;
for (it = mp.begin(); it != mp.end(); it++) {
f = it->second;
if (f % k) cout << -1 << endl, exit(0);
cnt = f / k;
for (int i = 0; i < cnt; i++) ans += it->first;
}
for (int i = 0; i < k; i++) res += ans;
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k;
cin >> k;
string s;
cin >> s;
unordered_map<char, int> mp;
for (int i = 0; i < s.length(); i++) {
mp[s[i]]++;
}
string ans = "";
for (auto f : mp) {
if (f.second % k == 0) {
for (int i = 0; i < (f.second / k); i++) {
ans += f.first;
}
} else {
cout << -1 << endl;
return 0;
}
}
string gg = "";
while (k--) {
gg += ans;
}
cout << gg << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, count = 0;
char ch;
cin >> k;
string s;
cin >> s;
int l = s.size();
sort(s.begin(), s.begin() + s.size());
for (int i = 0; i < s.size(); i++) {
if (i % k == 0) {
ch = s[i];
}
if (s[i] == ch) {
count++;
}
}
if (l == count && count % k == 0) {
for (int i = 0; i < k; i++) {
for (int l = 0; l < s.size(); l += k) {
cout << s[l];
}
}
} else {
cout << "-1";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k;
vector<char> b;
cin >> k;
string a;
cin >> a;
int s = 0;
string p = "";
for (int i = 0; i < a.size(); i++) {
if (b.size() != 0) {
for (int j = 0; j < b.size(); j++) {
if (a[i] == b[j]) s = 1;
}
}
if (s == 0) b.push_back(a[i]);
s = 0;
}
int h[b.size()];
int count = 0;
for (int i = 0; i < b.size(); i++) {
for (int j = 0; j < a.size(); j++) {
if (b[i] == a[j]) count++;
}
h[i] = count;
count = 0;
}
for (int i = 0; i < b.size(); i++) {
if (h[i] % k != 0) {
cout << "-1" << endl;
return 0;
}
}
for (int i = 0; i < b.size(); i++) {
for (int j = 0; j < h[i] / k; j++) p = p + b[i];
}
for (int i = 0; i < k; i++) cout << p;
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a == 0) return b;
if (b == 0) return a;
if (a == b) return a;
if (a > b) return gcd(a - b, b);
return gcd(a, b - a);
}
int k;
string s;
int main() {
cin >> k;
cin >> s;
map<char, int> m;
int ss = s.size();
for (int i = 0; i < ss; i++) {
m[s.at(i)]++;
}
vector<char> c;
for (auto const& [key, val] : m) {
if (val % k != 0) {
cout << -1;
return 0;
}
c.push_back(key);
}
int cs = c.size();
int h;
for (int z = 0; z < k; z++) {
for (int i = 0; i < cs; i++) {
h = m[c.at(i)] / k;
for (int j = 0; j < h; j++) {
cout << c.at(i);
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string tmp;
cin >> n >> tmp;
map<char, int> freq;
for (int i = 0; i < tmp.length(); i++) freq[tmp[i]]++;
string output = "";
bool possible = true;
for (map<char, int>::iterator i = freq.begin(); i != freq.end(); i++) {
if ((*i).second % n == 0)
for (int j = 0; j < (*i).second / n; j++) output = output + (*i).first;
else {
possible = false;
break;
}
}
if (possible) {
for (int i = 0; i < n; i++) cout << output;
cout << endl;
} else
cout << -1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int sz = 2e5 + 10;
int k, fl, ar[26];
string s;
int main() {
while (cin >> k >> s) {
memset(ar, 0, sizeof ar);
for (char c : s) {
ar[c - 'a']++;
}
fl = 1;
for (int i = 0; i < 26; i++)
if (ar[i] % k) fl = 0;
if (fl) {
string ans;
for (int i = 0; i < 26; i++) {
if (ar[i]) ans += string(ar[i] / k, i + 'a');
}
for (int i = k; i > 0; i--) {
cout << ans;
}
cout << "\n";
} else {
cout << "-1\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int k;
cin >> k;
string s;
cin >> s;
unordered_map<char, int> freq;
for (int i = 0; i < s.size(); i++) {
freq[s[i]]++;
}
int flag = 0;
for (auto x : freq) {
if (x.second % k != 0) {
flag = 1;
break;
}
}
if (flag == 1) {
cout << -1;
return 0;
} else {
int hehe = 0;
while (hehe < s.size()) {
for (auto x : freq) {
for (int i = 0; i < x.second / k; i++) {
cout << x.first;
hehe++;
}
}
}
return 0;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string a;
int f[140] = {};
cin >> a;
bool b = true;
for (int i = 0; i < a.size(); i++) {
int x = a[i];
f[x]++;
}
for (int i = 97; i < 124; i++) {
if (f[i] != 0 && f[i] % n != 0) {
b = false;
} else if (f[i] != 0) {
f[i] /= n;
}
}
if (b) {
for (int i = 0; i < n; i++) {
for (int i = 97; i < 124; i++) {
if (f[i] != 0) {
char c = i;
for (int j = f[i]; j > 0; j--) {
cout << c;
}
}
}
}
} else
cout << -1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j = 0;
string s;
cin >> n >> s;
sort(s.begin(), s.end());
for (i = 0; i < s.length(); i++) {
if (i % n == 0) j = i;
if (s[i] != s[j]) break;
}
if (i < s.length() || s.length() % n)
cout << -1;
else {
for (i = 1; i <= n; i++) {
for (j = 0; j < s.length(); j += n) {
cout << s[j];
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
char a[100010];
int b[26];
int main() {
int n;
memset(a, 0, sizeof(a));
while (scanf("%d %s", &n, a) != EOF) {
bool flag = 1;
memset(b, 0, sizeof(b));
for (int i = 0; a[i]; i++) {
b[a[i] - 'a']++;
}
int k = 0;
memset(a, 0, sizeof(a));
for (int i = 0; i < 26; i++) {
if (b[i] % n != 0) {
flag = 0;
} else {
int x = b[i] / n;
while (x) {
a[k++] = char('a' + i);
x--;
}
}
}
if (flag) {
for (int i = 0; i < n; i++) printf("%s", a);
cout << endl;
} else
cout << "-1" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = int(1e5 + 3);
int a[26];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int k;
cin >> k;
char first;
int c = 0;
while (cin >> first) {
a[first - 'a']++;
c++;
}
string second = "";
for (int i = 0; i < 26; i += 1) {
if (!(a[i] % k == 0)) {
puts("-1");
return 0;
}
}
for (int i = 0; i < 26; i += 1)
if (a[i])
for (int j = 0; j < a[i] / k; j += 1) second += (char)(i + 97);
for (int i = 0; i < c; i += second.size()) cout << second;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
string to_string(int a) {
ostringstream temp;
temp << a;
return temp.str();
}
bool is_prime(long long n) {
long long k = sqrt(n);
for (long long i = 2; i <= k; i++) {
if (n % i == 0) return false;
}
return true;
}
bool is_palindrome(vector<int> a, int n) {
int ans = 0;
for (int i = (int)(0); i < (int)(n / 2); ++i) {
if (a[i] != a[i + (n / 2)]) ans++;
}
if (ans == 0)
return true;
else
return false;
}
int solve() {
string a;
cin >> a;
vector<int> m;
for (int i = (int)(0); i < (int)(a.size()); ++i) {
if (a[i] == a[i + 1] && a[i] != '?') {
cout << -1 << "\n";
return 0;
}
if (a[i] == '?') m.push_back(i);
}
for (int i = (int)(0); i < (int)(m.size()); ++i) {
if (a[m[i] - 1] == 'a') {
(a[m[i] + 1] == 'b') ? a[m[i]] = 'c' : a[m[i]] = 'b';
} else if (a[m[i] - 1] == 'b') {
(a[m[i] + 1] == 'c') ? a[m[i]] = 'a' : a[m[i]] = 'c';
} else
(a[m[i] + 1] == 'a') ? a[m[i]] = 'b' : a[m[i]] = 'a';
}
cout << a << "\n";
return 0;
}
int check(int n) {
while (!is_prime(n)) {
n++;
}
return n;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int k;
cin >> k;
string s;
cin >> s;
map<char, int> m;
string f = s.substr(0, (s.size() / k));
if (s.size() % k != 0) {
cout << -1;
return 0;
}
string d;
for (int i = (int)(0); i < (int)(s.size()); ++i) m[s[i]]++;
map<char, int>::iterator it;
for (it = m.begin(); it != m.end(); it++) {
if ((it->second) % k != 0) {
cout << -1;
return 0;
}
for (int i = (int)(0); i < (int)((it->second) / k); ++i) d += it->first;
}
for (int i = (int)(0); i < (int)(k); ++i) {
cout << d;
}
return 0;
}
|
#include <bits/stdc++.h>
bool DEBUG = false;
using namespace std;
int k;
int len;
char buf[2000];
int mas[26];
int main() {
scanf("%d\n", &k);
gets(buf);
len = strlen(buf);
for (int i = 0; i < (len); ++i) mas[buf[i] - 'a']++;
for (int i = 0; i < (26); ++i)
if (mas[i] % k != 0) {
printf("-1");
return 0;
}
len = 0;
for (int i = 0; i < (26); ++i)
for (int j = 0; j < (mas[i] / k); ++j) buf[len++] = 'a' + i;
buf[len] = '\0';
for (int i = 0; i < (k); ++i) printf("%s", buf);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 1 << 30;
const long long int INF = 1e18;
const int MOD = 1e9 + 7;
const int MAXN = 300005;
bool Compare(const pair<int, int> &x, const pair<int, int> &y) {
if (x.first == y.first) {
return x.second > y.second;
}
return x.first < y.first;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int k;
string s;
cin >> k >> s;
int a[26];
memset(a, 0, sizeof(a));
int len = s.length();
for (int i = 0; i < len; i++) {
a[s[i] - 'a']++;
}
string ans;
ans = "";
for (int i = 0; i < 26; i++) {
if (a[i] != 0 && a[i] % k != 0) {
cout << -1 << '\n';
return 0;
}
for (int j = 0; j < (a[i] / k); j++) {
char ch = 'a' + i;
ans += ch;
}
}
for (int i = 0; i < k; i++) {
cout << ans;
}
cout << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, count = 0;
cin >> k;
char ch;
string s;
cin >> s;
int l = s.length();
sort(s.begin(), s.begin() + s.size());
for (int i = 0; i < l; i++) {
if (i % k == 0) {
ch = s[i];
}
if (ch == s[i]) count++;
}
if (count == l && count % k == 0) {
for (int i = 0; i < k; i++) {
for (int j = 0; j < l; j += k) {
cout << s[j];
}
}
} else
cout << "-1";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 2e5 + 5;
const long long mod = 1e9 + 7;
long long fpow(long long a, long long n) {
if (n == 0) return 1;
if (n % 2 == 1)
return (a * fpow(a * a % mod, n / 2)) % mod;
else
return fpow(a * a % mod, n / 2);
}
long long T = 1;
void unstoppable() {
long long n;
string s;
cin >> n >> s;
map<char, long long> mp, vis;
for (char c : s) mp[c]++;
for (auto e : mp)
if (e.second % n) {
cout << -1;
return;
}
string ans = "";
for (long long i = 0; i < s.size(); ++i) {
if (!vis[s[i]]) {
vis[s[i]] = 1;
long long tmp = mp[s[i]] / n;
for (long long j = 0; j < tmp; ++j) ans += s[i];
}
}
while (n--) {
cout << ans;
}
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
while (T--) {
unstoppable();
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int arr[26] = {0};
multimap<int, char> mp;
int flag = 0;
for (int i = 0; i < s.length(); i++) {
arr[s[i] - 'a']++;
}
for (int i = 0; i < 26; i++) {
if (arr[i] % n != 0) {
flag = 1;
}
}
if (flag)
cout << -1 << endl;
else {
int j = 0;
for (int i = 0; i < 26; i++) {
if (arr[i] != 0) {
int p = arr[i] / n;
for (int x = 0; x < p; x++) {
s[j++] = i + 'a';
}
}
}
for (int j = 0; j < n; j++) {
for (int i = 0; i < s.length() / n; i++) {
cout << s[i];
}
}
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
struct TP {};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
int ar[26];
for (int i = 0; i < 26; i++) ar[i] = 0;
string s;
cin >> n >> s;
int ln = (int)(s.length());
for (int i = 0; i < ln; i++) ar[s[i] - 'a']++;
for (int i = 0; i < 26; i++) {
if (ar[i] % n) {
cout << -1;
return 0;
}
}
for (int k = 0; k < n; k++) {
for (int i = 0; i < 26; i++) {
for (int j = 0; j < ar[i] / n; j++) {
cout << (char)(i + 'a');
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
const long long inf = 1000000000000000000;
using namespace std;
long long gcd(long long a, long long b) {
if (a < b) gcd(b, a);
if (b == 0) return a;
return gcd(b, a % b);
}
long long lcm(long long a, long long b) {
long long x = (a / gcd(a, b)) * b;
return x;
}
long long power(long long x, long long n, long long m = inf) {
if (x == 0) {
return 0;
}
if (n == 0) {
return 1;
}
long long ans;
if (n % 2 == 0) {
long long smallAns = power(x, n / 2, m);
ans = (smallAns * smallAns) % m;
} else {
long long smallAns = power(x, n - 1, m);
ans = x;
ans = (ans * smallAns) % m;
}
return (ans + m) % m;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
while (t--) {
int k;
cin >> k;
string s;
cin >> s;
int arr[26];
for (int i = 0; i < 26; i += 1) {
arr[i] = 0;
}
int n = s.length();
for (int i = 0; i < n; i += 1) {
arr[s[i] - 'a']++;
}
for (int i = 0; i < 26; i += 1) {
if (arr[i] % k != 0) {
cout << -1 << '\n';
return 0;
}
}
string ab;
for (int i = 0; i < 26; i += 1) {
int val = arr[i] / k;
for (int j = 0; j < val; j += 1) {
ab += (char)(i + 'a');
}
}
for (int i = 0; i < k; i += 1) cout << ab;
cout << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[1005];
int a[30];
int main() {
int i, j, flag, k, p;
while (~scanf("%d", &k)) {
getchar();
scanf("%s", s);
memset(a, 0, sizeof(a));
for (i = 0; s[i] != '\0'; i++) {
a[s[i] - 'a' + 1]++;
}
flag = 1;
for (i = 1; i <= 26; i++) {
if (a[i] && a[i] / k != a[i] * 1.0 / k) {
flag = 0;
break;
}
}
if (flag) {
for (i = 1; i <= k; i++) {
for (p = 1; p <= 26; p++) {
if (a[p]) {
for (j = 1; j <= a[p] / k; j++) putchar('a' + p - 1);
}
}
}
} else
printf("-1");
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
const int N = 2e5 + 5;
using namespace std;
int main() {
int k, cnt = 0;
char c;
cin >> k;
string s;
cin >> s;
int l = s.size();
sort(s.begin(), s.begin() + s.size());
for (int i = 0; i < l; i++) {
if (i % k == 0) {
c = s[i];
}
if (s[i] == c) {
cnt++;
}
}
if (l == cnt && cnt % k == 0) {
for (int i = 0; i < k; i++) {
for (int l = 0; l < s.size(); l += k) {
cout << s[l];
}
}
} else
cout << "-1";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int letters[27];
int k;
int l;
int ssize;
char s[1001];
char c[1001];
for (int i = 0; i < 1001; i++) c[i] = 0;
for (int i = 0; i < 27; i++) letters[i] = 0;
cin >> k;
cin >> s;
for (ssize = 0; ssize < 1001; ssize++)
if (s[ssize] == 0) break;
for (int i = 0; i < ssize; i++) {
letters[s[i] - 'a']++;
}
for (int i = 0; i < 27; i++) {
if (letters[i] % k) {
cout << -1;
exit(0);
}
}
for (int i = 0; i < 27; i++) letters[i] = letters[i] / k;
for (int i = 0, m = 0; i < 27; i++) {
for (int j = 0; letters[i] > 0; j++) {
c[m] = 'a' + i;
letters[i]--;
m++;
}
l = m;
}
for (int i = 0; i < ssize / k; i++) {
for (int j = 0; j < k; j++) {
c[l * j + i] = c[i];
}
}
cout << c;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int cnt[26] = {};
for (int i = 0; i < s.size(); ++i) {
cnt[s[i] - 'a']++;
}
for (int i = 0; i < 26; ++i) {
if (cnt[i] % n != 0) {
cout << -1 << endl;
return 0;
}
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < 26; ++j) {
for (int k = 0; k < cnt[j] / n; ++k) {
cout << char('a' + j);
}
}
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
void CyBerForCe() {
long long k;
cin >> k;
string s;
cin >> s;
map<char, long long> mp;
long long l = s.length();
for (long long i = 0; i < l; i++) mp[s[i]]++;
for (auto i : mp) {
if (i.second % k != 0) {
cout << "-1\n";
return;
}
}
string t = "";
for (auto i : mp) {
for (long long j = 0; j < (i.second / k); j++) t += i.first;
}
for (long long i = 0; i < k; i++) cout << t;
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
CyBerForCe();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return (b ? gcd(b, a % b) : a); }
bool isPrime(long long n) {
if (n == 1) return false;
if (n == 2) return true;
for (long long i = 2; i * i <= n; i++) {
if (n % i == 0) return false;
}
return true;
}
long long power(long long x, unsigned long long y, long long p = 1000000007) {
long long res = 1;
x = x % p;
if (x == 0) return 0;
while (y > 0) {
if (y & 1) {
res = (res * x) % p;
}
y = y >> 1;
x = (x * x) % p;
}
return res;
}
long long digit(long long n) {
long long ans = 0;
while (n) {
ans++;
n /= 10;
}
return ans;
}
long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
vector<long long> sieve(long long n) {
long long *arr = new long long[n + 1]();
vector<long long> vect;
for (long long i = 2; i <= n; i++)
if (arr[i] == 0) {
vect.push_back(i);
for (long long j = 2 * i; j <= n; j += i) arr[j] = 1;
}
return vect;
}
void solve() {
long long n;
cin >> n;
string s;
cin >> s;
map<char, long long> m;
long long len = s.size();
if (len % n) {
cout << -1 << endl;
return;
}
for (auto i : s) {
m[i]++;
}
string ans = "";
for (auto i : m) {
if (i.second % n) {
cout << -1 << endl;
return;
}
for (long long j = 0; j < i.second / n; j++) {
ans += i.first;
}
}
for (long long i = 0; i < len / ans.size(); i++) {
cout << ans;
}
cout << endl;
}
int32_t main() {
ios_base ::sync_with_stdio(false), cin.tie(NULL);
long long t = 1;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k;
cin >> k;
string s;
cin >> s;
int count[26] = {0};
for (char x : s) {
count[x - 'a']++;
}
string temp;
string res;
bool flag = true;
for (int i = 0; i < 26; i++) {
int x = count[i];
if (x % k != 0) {
flag = false;
break;
} else {
char y = i + 'a';
for (int j = 0; j < x / k; j++) {
temp += y;
}
}
}
for (int i = 0; i < k; i++) res += temp;
if (flag)
cout << res;
else
cout << -1;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.