# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
40571 | Just_Solve_The_Problem | Gift (IZhO18_nicegift) | C++11 | 733 ms | 119920 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 <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair < ll, ll >
#define fr first
#define sc second
#define mk make_pair
const int N = (int)1e6 + 7;
ll sum = 0;
ll a[N];
vector < vector < pii > > block;
vector < vector < ll > > ans;
vector < ll > ans1;
int pointer[N];
main() {
int n; ll k; scanf("%d %lld", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
sum += a[i];
}
if (sum % k != 0) {
puts("-1");
return 0;
}
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... |