This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main () {
int n, k;
cin >> n >> k;
int a[n];
for (auto &i : a) cin >> i;
for (int i = 0; i < n; i++) {
for (int j = 1; (n - i) / j >= k; j++) {
bool flag = 1;
for (int cnt = 2; cnt <= k; cnt++) {
for (int l = i + j * (cnt - 1); l < i + j * cnt; l++) {
flag &= a[l] == a[l - j];
}
}
if (flag) {
cout << j << '\n';
for (int l = i; l < i + j; l++) cout << a[l] << " ";
cout << '\n';
return 0;
}
}
}
cout << -1 << '\n';
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |