# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
22835 | 버거킹 송죽SK점 우수고객 (#40) | Unifying Values (KRIII5_UV) | C++98 | 79 ms | 2252 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;
typedef long long ll;
const ll mod = 1e9+7;
ll n, a[10005], s[10005], ans, dt[10005];
bool valid (ll A, ll B) {
return (A % B == 0 && A / B >= 1);
}
ll solve (ll idx) {
if(idx == n) return 1;
if(!valid(s[n], s[idx])) return 0;
ll t = s[n]/s[idx];
if(t == 1 || n-idx+1 <= t) return 0;
for(ll i=0;i<t;i++) dt[i] = 0;
dt[1] = 1;
for(ll i=idx+1;i<n;i++) {
if(!valid(s[i], s[idx])) continue;
ll tt = s[i]/s[idx];
if(tt >= t) continue;
dt[tt] = (dt[tt] + dt[tt-1]) % mod;
}
return dt[t-1];
}
ll solve_zero () {
if(s[n] != 0) return 0;
ll ret = 1;
for(ll i=1;i<n;i++) {
if(s[i] == 0) ret = (ret * 2) % mod;
}
return ret;
}
int main()
{
scanf("%lld",&n);
for(ll i=1;i<=n;i++) {
scanf("%lld",&a[i]);
s[i] = s[i-1] + a[i];
}
for(ll i=1;i<=n;i++) {
ans = (ans + (s[i] ? solve(i) : 0)) % mod;
}
ans = (ans + solve_zero()) % mod;
printf("%lld\n",(ans+mod-1)%mod);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |