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>
unsigned 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<=250; i++){
coin[i] = (coin[i-1]*2) % MOD;
}
for(int i = 1; i<=250; i++){
printf("%llu\n", coin[i]);
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |