Submission #19740

#TimeUsernameProblemLanguageResultExecution timeMemory
19740jihoon동전 (kriii4_E)C++98
100 / 100
165 ms263228 KiB
#include<cstdio> #define je 1000000007; long long bae[256][512][256]; int main(){ int n,coverage=1,cal; scanf("%d",&n); bae[0][0][0]=1; for(int i=0;i<n;i++){ for(int j=0;j<=511;j++){ for(int k=0;k<=i;k++){ bae[i+1][j][0]+=bae[i][j][k]; bae[i+1][j][0]%=je; cal=j; cal^=k;cal^=k+1; bae[i+1][cal][k+1]+=bae[i][j][k]; bae[i+1][cal][k+1]%=je; } } } for(int j=1;j<=n;j++){ bae[n][0][0]+=bae[n][0][j]; bae[n][0][0]%=je; } printf("%d",bae[n][0][0]); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...