# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
92154 | davitmarg | Gift (IZhO18_nicegift) | C++17 | 926 ms | 22472 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.
/*
DEATH-MATCH
Davit-Marg
*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <iterator>
#include <ctype.h>
#include <stdlib.h>
#include <cassert>
#include <fstream>
#define mod 998244353ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
using namespace std;
LL n,k,a[1000006],d,v;
int main()
{
cin >> n >> k;
for (LL i = 0; i < n; i++)
scanf("%lld",a+i);
d = n % k + 1;
if (a[0] % d != 0)
{
cout << -1 << endl;
return 0;
}
cout << d * n / k;
for (LL i = 0; i < d*n; i++)
{
v %= k;
if (v == 0)
cout<<endl << a[0] / d << " ";
cout<<(i%n)+1<<" ";
v++;
}
cout << endl;
return 0;
}
/*
4 2
5 5 5 5
14 7
10 10 10 10 10 10 10 10 10 10 10 10 10 10
*/
Compilation message (stderr)
# | 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... |