| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 19778 |
2016-02-25T05:31:42 Z |
ainta |
동전 (kriii4_E) |
C++ |
|
45 ms |
1348 KB |
#include<stdio.h>
int D[260][260], Mod = 1000000007, n;
int main(){
int i,j,k;
scanf("%d",&n);
D[0][0]=1;
for(i=1;i<=n+1;i++){
for(j=1;j<=i;j++){
for(k=0;k<256;k++){
D[i][k^(j-1)] = (D[i][k^(j-1)] + D[i-j][k])%Mod;
}
}
}
printf("%d\n",D[n+1][0]);
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
1348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
1348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
1348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
1348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
1348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
1348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
1348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
1348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
1348 KB |
Output is correct |
| 11 |
Correct |
0 ms |
1348 KB |
Output is correct |
| 12 |
Correct |
0 ms |
1348 KB |
Output is correct |
| 13 |
Correct |
0 ms |
1348 KB |
Output is correct |
| 14 |
Correct |
0 ms |
1348 KB |
Output is correct |
| 15 |
Correct |
0 ms |
1348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
10 ms |
1348 KB |
Output is correct |
| 2 |
Correct |
20 ms |
1348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
1348 KB |
Output is correct |
| 4 |
Correct |
5 ms |
1348 KB |
Output is correct |
| 5 |
Correct |
3 ms |
1348 KB |
Output is correct |
| 6 |
Correct |
8 ms |
1348 KB |
Output is correct |
| 7 |
Correct |
31 ms |
1348 KB |
Output is correct |
| 8 |
Correct |
38 ms |
1348 KB |
Output is correct |
| 9 |
Correct |
11 ms |
1348 KB |
Output is correct |
| 10 |
Correct |
36 ms |
1348 KB |
Output is correct |
| 11 |
Correct |
6 ms |
1348 KB |
Output is correct |
| 12 |
Correct |
6 ms |
1348 KB |
Output is correct |
| 13 |
Correct |
34 ms |
1348 KB |
Output is correct |
| 14 |
Correct |
22 ms |
1348 KB |
Output is correct |
| 15 |
Correct |
11 ms |
1348 KB |
Output is correct |
| 16 |
Correct |
0 ms |
1348 KB |
Output is correct |
| 17 |
Correct |
44 ms |
1348 KB |
Output is correct |
| 18 |
Correct |
0 ms |
1348 KB |
Output is correct |
| 19 |
Correct |
19 ms |
1348 KB |
Output is correct |
| 20 |
Correct |
0 ms |
1348 KB |
Output is correct |
| 21 |
Correct |
27 ms |
1348 KB |
Output is correct |
| 22 |
Correct |
21 ms |
1348 KB |
Output is correct |
| 23 |
Correct |
14 ms |
1348 KB |
Output is correct |
| 24 |
Correct |
9 ms |
1348 KB |
Output is correct |
| 25 |
Correct |
5 ms |
1348 KB |
Output is correct |
| 26 |
Correct |
0 ms |
1348 KB |
Output is correct |
| 27 |
Correct |
34 ms |
1348 KB |
Output is correct |
| 28 |
Correct |
0 ms |
1348 KB |
Output is correct |
| 29 |
Correct |
33 ms |
1348 KB |
Output is correct |
| 30 |
Correct |
45 ms |
1348 KB |
Output is correct |
