# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
19815 |
2016-02-25T05:53:35 Z |
yukariko |
괄호 (kriii4_R) |
C++14 |
|
8 ms |
4088 KB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
ll N, K;
int main() {
scanf("%lld%lld", &N, &K);
vector<ll> cache(N + 1);
cache[0] = cache[1] = 1;
for (ll i = 2; i <= N; i++)
cache[i] = ((cache[i - 1] * 2 + cache[i - 2] * 4 * (i - 1)) % MOD / (i + 1) % MOD) % MOD;
printf("%lld", cache[N]);
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
8 ms |
4088 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Halted |
0 ms |
0 KB |
- |