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()
{
cin.tie(0)->sync_with_stdio(0);
int n, K; cin >> n >> K;
vector<long long> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
if (a[0] * n % K != 0)
{
cout << -1 << '\n';
return 0;
}
vector<vector<int>> ans;
for (int i = 0; !(i != 0 && i % n == 0); i += K)
{
ans.emplace_back();
for (int j = i; j < i + K; j++)
ans.back().emplace_back(j % n);
}
cout << ans.size() << '\n';
for (auto &vec : ans)
{
cout << a[0] * n / K / ans.size() << ' ';
for (int j = 0; j < K; j++)
cout << vec[j] + 1 << " \n"[j == K - 1];
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |