# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
19832 | onjo0127 | 동전 (kriii4_E) | C++98 | 0 ms | 1092 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>
long long dp[1000];
int main()
{
int n,i;
scanf("%d",&n);
dp[1] = 1;
dp[2] = 1;
for(i=3;i<=n;i++) {
dp[i] = dp[i-1] * 2;
dp[i] %= 1000000007;
}
printf("%d",dp[n]);
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |