# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
22353 | 크리님 제가 귀여우면 됬지 뭘 더 원하세요 진짜 (#40) | Unifying Values (KRIII5_UV) | C++11 | 0 ms | 2180 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::pair;
std::map<pair<long long, int>, long long> map;
const long long MOD = 1000000007;
long long arr[10010];
long long sum[10010];
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];
}
long long p = sum[n];
for (int i = 1; i <= n; i++) {
if (p%sum[i] == 0) {
map[{sum[i], 1}]++;
}
for (auto q : map) {
if (q.first.first*(q.first.second + 1) == sum[i]) {
map[{q.first.first, q.first.second + 1}] += q.second;
map[{q.first.first, q.first.second + 1}] %= MOD;
}
}
}
long long ans = 0;
for (auto q : map) {
if (q.first.first*q.first.second == p && q.first.second!=1) {
ans += q.second;
ans %= MOD;
}
}
printf("%lld", ans);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |