# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
19970 | isac322 | 동전 (kriii4_E) | C++14 | 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>
long long coin[251] = { 0, 1, 1, };
const long long int MOD = 1000000007;
int main(){
int N;
scanf("%d", &N);
for(int i = 3; i<=N; i++){
coin[i] = (1 << (i-2)) % MOD;
}
printf("%lld\n", coin[N]);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |