Submission #19815

#TimeUsernameProblemLanguageResultExecution timeMemory
19815yukariko괄호 (kriii4_R)C++14
0 / 100
8 ms4088 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...