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 <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int m = 1; m * k <= n; m++) {
for (int s = 0; s + m * k <= n; s++) {
bool flag = true;
for (int i = 0; i < m * k; i++) {
if (a[s + i] != a[s + (i % m)]) {
flag = false;
break;
}
}
if (flag) {
cout << m << endl;
for (int i = 0; i < m; i++) {
if (i > 0) cout << " ";
cout << a[s + i];
}
cout << endl;
return 0;
}
}
}
cout << -1 << endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |