# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
22743 | 2017-04-30T07:11:38 Z | 크리님 제가 귀여우면 됬지 뭘 더 원하세요 진짜(#952, sys7961, hyorothy, skdudn321) | Unifying Values (KRIII5_UV) | C++11 | 6 ms | 2256 KB |
#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 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]; long long ans = 0; for (int i = 1; i <= n; i++) { if (sum[i] != 0 && set.count(sum[i]) == 0) { if ( p%sum[i] == 0) { set.insert(sum[i]); long long k = abss(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 && sum[j]!=0) { long long q = abss(sum[j] / sum[i]); cnt[q] += cnt[q - 1]; cnt[q] %= MOD; } } ans += cnt[k]; ans %= MOD; } } } printf("%lld", ans); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 2256 KB | Output is correct |
2 | Correct | 0 ms | 2256 KB | Output is correct |
3 | Correct | 0 ms | 2256 KB | Output is correct |
4 | Correct | 3 ms | 2256 KB | Output is correct |
5 | Correct | 6 ms | 2256 KB | Output is correct |
6 | Incorrect | 0 ms | 2256 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 2256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |