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 <stdio.h>
int mod = 1e9 + 7;
int n, d[333][333];
int main() {
scanf("%d", &n);
d[0][0] = 1;
for (int i = 0; i <= n; i++) for (int j = 0; j < 256; j++) {
d[i + 1][j] = d[i][j];
for (int k = 1; k <= i; k++) d[i + 1][j] = (d[i + 1][j] + d[i - k][j^k]) % mod;
}
printf("%d", d[n + 1][0]);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |