# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
19970 |
2016-02-25T07:57:11 Z |
isac322 |
동전 (kriii4_E) |
C++14 |
|
0 ms |
1084 KB |
#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 |
1 |
Correct |
0 ms |
1084 KB |
Output is correct |
2 |
Correct |
0 ms |
1084 KB |
Output is correct |
3 |
Correct |
0 ms |
1084 KB |
Output is correct |
4 |
Correct |
0 ms |
1084 KB |
Output is correct |
5 |
Correct |
0 ms |
1084 KB |
Output is correct |
6 |
Incorrect |
0 ms |
1084 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Halted |
0 ms |
0 KB |
- |