Submission #19778

#	Time	Username	Problem	Language	Result	Execution time	Memory
19778		ainta	동전 (kriii4_E)	C++98	100 / 100	45 ms	1348 KiB

D

#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]);
}

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