Submission #20090

#TimeUsernameProblemLanguageResultExecution timeMemory
20090hongjun7동전 (kriii4_E)C++98
100 / 100
84 ms1516 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...