# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
22890 | sys7961 | Unifying Values (KRIII5_UV) | C++11 | 3 ms | 2444 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 std::vector;
using std::pair;
const long long MOD = 1000000007;
std::set<long long> set;
long long arr[10010];
long long sum[10010];
long long cnt[10010];
long long abss(long long a) {
if (a < 0)return -a;
return a;
}
int sign(long long a) {
if (a > 0)return 1;
if (a < 0)return -1;
return 0;
}
long long poww(long long a, long long b) {
if (b == 0)return 1;
long long tmp = pow(a, b / 2);
if (b % 2 == 1)return (((tmp*tmp) % MOD)*a) % MOD;
return (tmp*tmp) % MOD;
}
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%lld", &arr[i]);
sum[i] = sum[i - 1] + arr[i];
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |