# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
378868 | Seanliu | Gift (IZhO18_nicegift) | C++14 | 0 ms | 0 KiB |
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 <map>
#include <deque>
#include <vector>
#define int long long int
using namespace std;
const int maxN = 1e6 + 326;
int N, K;
signed main(){
cin >> N >> K;
int x;
cin >> x;
for(int i = 1; i <= N; i++) cin >> x;
if(N % K){
cout << -1 << endl;
return 0;
}
cout << N / K << endl;
for(int i = 1; i <= N; i += K){
cout << arr[1] << " ";
for(int j = i; j < i + K; j++) cout << j << " ";
cout << endl;
}
}