# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
23146 | ainta | Unifying Values (KRIII5_UV) | C++14 | 109 ms | 1232 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<cstdio>
#include<algorithm>
using namespace std;
int n, D[10100], Mod = 1000000007, Res;
long long S[10100];
void Do(int K){
int i;
long long t = S[n]/K, tp;
for(i=0;i<=K;i++)D[i] = 0;
D[0] = 1;
for(i=1;i<=n;i++){
tp = S[i]/t;
if(tp*t!=S[i])continue;
if(tp<=0||tp>K)continue;
D[tp] = (D[tp]+D[tp-1])%Mod;
}
Res = (Res + D[K-1])%Mod;
}
int main(){
int i;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%lld",&S[i]);
S[i]+=S[i-1];
}
if(S[n]==0){
Res = 1;
for(i=1;i<n;i++){
if(S[i]==0)Res=Res*2%Mod;
}
Res=(Res-1)%Mod;
printf("%d\n",Res);
return 0;
}
for(i=2;i<=n;i++){
if(S[n]%i==0){
Do(i);
}
}
printf("%d\n",Res);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |