Submission #19992

#	Time	Username	Problem	Language	Result	Execution time	Memory
19992		gs12117	동전 (kriii4_E)	C++98	100 / 100	89 ms	1348 KiB

D

#include<stdio.h>
int n;
int mod=1000000007;
int dp[260][260];
int main(){
	int i,j,k;
	scanf("%d",&n);
	dp[0][0]=1;
	for(i=0;i<=n;i++){
		for(j=0;j<256;j++){
			dp[i+1][j]=dp[i][j]%mod;
			for(k=1;k<=i;k++){
				dp[i+1][j]+=dp[i-k][j^k]%mod;
				dp[i+1][j]%=mod;
			}
		}
	}
	printf("%d",dp[n+1][0]);
}

• Subtask 1: 5 / 5
• Subtask 2: 95 / 95