# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
22720 | 크리님 제가 귀여우면 됬지 뭘 더 원하세요 진짜 (#40) | Unifying Values (KRIII5_UV) | C++11 | 0 ms | 2256 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];
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];
//set.insert(sum[i]);
}
long long p = sum[n];
long long ans = 0;
for (int i = 1; i <= n; i++) {
if (set.count(sum[i]) == 0) {
if (p%sum[i] == 0) {
set.insert(sum[i]);
long long k = p / sum[i];
if (k > n || k==1)break;
for (int j = 1; j <= k; j++) {
cnt[j] = 0;
}
cnt[0] = 1;
for (int j = i; j <= n; j++) {
if (sum[j] % sum[i] == 0) {
long long q = sum[j] / sum[i];
cnt[q] += cnt[q - 1];
cnt[q] %= MOD;
}
}
ans += cnt[k];
ans %= MOD;
}
}
}
printf("%lld", ans);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |