# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
19931 | | ilbbke | 동전 (kriii4_E) | C++98 | | 0 ms | 1084 KiB |
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>
#define M 1000000007
int n;
long long dy[255];
int main()
{
scanf("%d",&n);
dy[1]=1; dy[2]=1;
int i,j;
for(i=3;i<=n;i++){
for(j=i-2;j>=1;j--){
dy[i]=(dy[i]+dy[j]*2%M)%M;
}
}
printf("%lld",dy[n]);
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |