oj.uz

Submission #23145

# Submission time Handle Problem Language Result Execution time Memory
23145 2017-05-03T14:15:01 Z ainta Unifying Values (KRIII5_UV) C++14
7 / 7
 99 ms 1232 KB 
/*#include<cstdio>
#include<algorithm>
using namespace std;
int P[110], Mod = 1000000007, n, w[60], Comb[5110][110], C[110][110];
int D[51][5010], sum;
int main(){
    int i, j, k;
    for(i=0;i<=5101;i++){
        Comb[i][0]=1;
        for(j=1;j<=100&&j<=i;j++){
            Comb[i][j]=(Comb[i-1][j-1]+Comb[i-1][j])%Mod;
        }
    }
    for(i=1;i<=100;i++){
        int s = 0;
        for(j=1;j<i;j++){
            s = (s + 1ll * P[j]*(i-j))%Mod;
        }
        P[i] = (i - s + Mod)%Mod;
    }
    C[0][0] = 1;
    for(i=0;i<100;i++){
        for(j=0;j<=100;j++){
            for(k=0;k+j<=100;k++){
                C[j+k][i+1] = (C[j+k][i+1] + 1ll * C[j][i] * P[k])%Mod;
            }
        }
    }
    scanf("%d",&n);
    for(i=1;i<=n;i++)scanf("%d",&w[i]);
    D[0][0] = 1;
    for(i=1;i<=n;i++){
        for(j=0;j<=sum;j++){
            for(k=1;k<=w[i];k++){
                D[i][j+k] = (D[i][j+k] + 1ll * Comb[j+k][k] * C[w[i]][k] % Mod * D[i-1][j])%Mod;
            }
        }
        sum += w[i];
    }
    int ss = 0;
    int res = 0;
    for(i=0;i<=sum;i++)res = (res + D[n][i])%Mod;
    printf("%d\n",res);
}*/
#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

UV.cpp: In function 'int main()':
UV.cpp:65:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
                   ^
UV.cpp:67:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld",&S[i]);
                            ^

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1232 KB Output is correct
2 Correct 0 ms 1232 KB Output is correct
3 Correct 0 ms 1232 KB Output is correct
4 Correct 3 ms 1232 KB Output is correct
5 Correct 3 ms 1232 KB Output is correct
6 Correct 0 ms 1232 KB Output is correct
7 Correct 0 ms 1232 KB Output is correct
8 Correct 0 ms 1232 KB Output is correct
9 Correct 0 ms 1232 KB Output is correct
10 Correct 0 ms 1232 KB Output is correct
11 Correct 0 ms 1232 KB Output is correct
12 Correct 0 ms 1232 KB Output is correct
13 Correct 3 ms 1232 KB Output is correct
14 Correct 0 ms 1232 KB Output is correct
15 Correct 0 ms 1232 KB Output is correct
16 Correct 0 ms 1232 KB Output is correct
17 Correct 0 ms 1232 KB Output is correct
18 Correct 0 ms 1232 KB Output is correct
19 Correct 0 ms 1232 KB Output is correct
20 Correct 0 ms 1232 KB Output is correct
21 Correct 0 ms 1232 KB Output is correct
22 Correct 0 ms 1232 KB Output is correct
23 Correct 0 ms 1232 KB Output is correct
24 Correct 0 ms 1232 KB Output is correct
25 Correct 0 ms 1232 KB Output is correct
26 Correct 0 ms 1232 KB Output is correct
27 Correct 0 ms 1232 KB Output is correct
28 Correct 0 ms 1232 KB Output is correct
29 Correct 3 ms 1232 KB Output is correct
30 Correct 0 ms 1232 KB Output is correct
31 Correct 0 ms 1232 KB Output is correct
32 Correct 3 ms 1232 KB Output is correct
33 Correct 3 ms 1232 KB Output is correct
34 Correct 0 ms 1232 KB Output is correct
35 Correct 3 ms 1232 KB Output is correct
36 Correct 3 ms 1232 KB Output is correct
37 Correct 3 ms 1232 KB Output is correct
38 Correct 3 ms 1232 KB Output is correct
39 Correct 3 ms 1232 KB Output is correct
40 Correct 3 ms 1232 KB Output is correct
41 Correct 3 ms 1232 KB Output is correct
42 Correct 0 ms 1232 KB Output is correct
43 Correct 3 ms 1232 KB Output is correct
44 Correct 0 ms 1232 KB Output is correct
45 Correct 3 ms 1232 KB Output is correct
46 Correct 3 ms 1232 KB Output is correct
47 Correct 3 ms 1232 KB Output is correct
48 Correct 3 ms 1232 KB Output is correct
49 Correct 0 ms 1232 KB Output is correct
50 Correct 3 ms 1232 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1232 KB Output is correct
2 Correct 3 ms 1232 KB Output is correct
3 Correct 0 ms 1232 KB Output is correct
4 Correct 0 ms 1232 KB Output is correct
5 Correct 3 ms 1232 KB Output is correct
6 Correct 3 ms 1232 KB Output is correct
7 Correct 9 ms 1232 KB Output is correct
8 Correct 3 ms 1232 KB Output is correct
9 Correct 0 ms 1232 KB Output is correct
10 Correct 0 ms 1232 KB Output is correct
11 Correct 0 ms 1232 KB Output is correct
12 Correct 0 ms 1232 KB Output is correct
13 Correct 3 ms 1232 KB Output is correct
14 Correct 3 ms 1232 KB Output is correct
15 Correct 3 ms 1232 KB Output is correct
16 Correct 3 ms 1232 KB Output is correct
17 Correct 6 ms 1232 KB Output is correct
18 Correct 6 ms 1232 KB Output is correct
19 Correct 0 ms 1232 KB Output is correct
20 Correct 3 ms 1232 KB Output is correct
21 Correct 3 ms 1232 KB Output is correct
22 Correct 3 ms 1232 KB Output is correct
23 Correct 3 ms 1232 KB Output is correct
24 Correct 3 ms 1232 KB Output is correct
25 Correct 0 ms 1232 KB Output is correct
26 Correct 0 ms 1232 KB Output is correct
27 Correct 3 ms 1232 KB Output is correct
28 Correct 6 ms 1232 KB Output is correct
29 Correct 3 ms 1232 KB Output is correct
30 Correct 23 ms 1232 KB Output is correct
31 Correct 6 ms 1232 KB Output is correct
32 Correct 6 ms 1232 KB Output is correct
33 Correct 3 ms 1232 KB Output is correct
34 Correct 9 ms 1232 KB Output is correct
35 Correct 13 ms 1232 KB Output is correct
36 Correct 6 ms 1232 KB Output is correct
37 Correct 6 ms 1232 KB Output is correct
38 Correct 13 ms 1232 KB Output is correct
39 Correct 6 ms 1232 KB Output is correct
40 Correct 46 ms 1232 KB Output is correct
41 Correct 59 ms 1232 KB Output is correct
42 Correct 16 ms 1232 KB Output is correct
43 Correct 53 ms 1232 KB Output is correct
44 Correct 53 ms 1232 KB Output is correct
45 Correct 26 ms 1232 KB Output is correct
46 Correct 26 ms 1232 KB Output is correct
47 Correct 33 ms 1232 KB Output is correct
48 Correct 39 ms 1232 KB Output is correct
49 Correct 69 ms 1232 KB Output is correct
50 Correct 46 ms 1232 KB Output is correct
51 Correct 43 ms 1232 KB Output is correct
52 Correct 56 ms 1232 KB Output is correct
53 Correct 26 ms 1232 KB Output is correct
54 Correct 33 ms 1232 KB Output is correct
55 Correct 56 ms 1232 KB Output is correct
56 Correct 56 ms 1232 KB Output is correct
57 Correct 33 ms 1232 KB Output is correct
58 Correct 43 ms 1232 KB Output is correct
59 Correct 43 ms 1232 KB Output is correct
60 Correct 49 ms 1232 KB Output is correct
61 Correct 99 ms 1232 KB Output is correct
62 Correct 56 ms 1232 KB Output is correct
63 Correct 43 ms 1232 KB Output is correct
64 Correct 3 ms 1232 KB Output is correct
65 Correct 3 ms 1232 KB Output is correct
66 Correct 13 ms 1232 KB Output is correct
67 Correct 3 ms 1232 KB Output is correct
68 Correct 6 ms 1232 KB Output is correct
69 Correct 3 ms 1232 KB Output is correct
70 Correct 0 ms 1232 KB Output is correct
71 Correct 6 ms 1232 KB Output is correct
72 Correct 9 ms 1232 KB Output is correct
73 Correct 9 ms 1232 KB Output is correct
74 Correct 6 ms 1232 KB Output is correct
75 Correct 16 ms 1232 KB Output is correct
76 Correct 6 ms 1232 KB Output is correct
77 Correct 46 ms 1232 KB Output is correct
78 Correct 59 ms 1232 KB Output is correct
79 Correct 3 ms 1232 KB Output is correct
80 Correct 19 ms 1232 KB Output is correct
81 Correct 13 ms 1232 KB Output is correct
82 Correct 3 ms 1232 KB Output is correct
83 Correct 9 ms 1232 KB Output is correct
84 Correct 76 ms 1232 KB Output is correct
85 Correct 43 ms 1232 KB Output is correct
86 Correct 6 ms 1232 KB Output is correct
87 Correct 3 ms 1232 KB Output is correct
88 Correct 13 ms 1232 KB Output is correct
89 Correct 6 ms 1232 KB Output is correct
90 Correct 6 ms 1232 KB Output is correct
91 Correct 0 ms 1232 KB Output is correct
92 Correct 0 ms 1232 KB Output is correct
93 Correct 0 ms 1232 KB Output is correct
94 Correct 3 ms 1232 KB Output is correct
95 Correct 3 ms 1232 KB Output is correct
96 Correct 0 ms 1232 KB Output is correct
97 Correct 0 ms 1232 KB Output is correct
98 Correct 0 ms 1232 KB Output is correct
99 Correct 0 ms 1232 KB Output is correct
100 Correct 0 ms 1232 KB Output is correct
101 Correct 0 ms 1232 KB Output is correct
102 Correct 0 ms 1232 KB Output is correct
103 Correct 3 ms 1232 KB Output is correct
104 Correct 0 ms 1232 KB Output is correct
105 Correct 0 ms 1232 KB Output is correct
106 Correct 0 ms 1232 KB Output is correct
107 Correct 0 ms 1232 KB Output is correct
108 Correct 0 ms 1232 KB Output is correct
109 Correct 0 ms 1232 KB Output is correct
110 Correct 0 ms 1232 KB Output is correct
111 Correct 0 ms 1232 KB Output is correct
112 Correct 0 ms 1232 KB Output is correct
113 Correct 0 ms 1232 KB Output is correct
114 Correct 0 ms 1232 KB Output is correct
115 Correct 0 ms 1232 KB Output is correct
116 Correct 0 ms 1232 KB Output is correct
117 Correct 0 ms 1232 KB Output is correct
118 Correct 0 ms 1232 KB Output is correct
119 Correct 3 ms 1232 KB Output is correct
120 Correct 0 ms 1232 KB Output is correct
121 Correct 0 ms 1232 KB Output is correct
122 Correct 3 ms 1232 KB Output is correct
123 Correct 3 ms 1232 KB Output is correct
124 Correct 0 ms 1232 KB Output is correct
125 Correct 3 ms 1232 KB Output is correct
126 Correct 3 ms 1232 KB Output is correct
127 Correct 3 ms 1232 KB Output is correct
128 Correct 3 ms 1232 KB Output is correct
129 Correct 3 ms 1232 KB Output is correct
130 Correct 3 ms 1232 KB Output is correct
131 Correct 3 ms 1232 KB Output is correct
132 Correct 0 ms 1232 KB Output is correct
133 Correct 3 ms 1232 KB Output is correct
134 Correct 0 ms 1232 KB Output is correct
135 Correct 3 ms 1232 KB Output is correct
136 Correct 3 ms 1232 KB Output is correct
137 Correct 3 ms 1232 KB Output is correct
138 Correct 3 ms 1232 KB Output is correct
139 Correct 0 ms 1232 KB Output is correct
140 Correct 3 ms 1232 KB Output is correct