Submission #19921

#TimeUsernameProblemLanguageResultExecution timeMemory
19921king7282괄호 (kriii4_R)C++98
0 / 100
2000 ms24516 KiB
#include <stdio.h> #define ll long long #define M 1000000007 ll dp[1000010], sum[2][1000010]; int main(void) { ll i, n, k; scanf("%lld %lld", &n ,&k); dp[0] = 1, dp[1] = 1; for(i = 2; i <= n; i++) { ll tmp = 0; for(ll j = 0; j < i / 2; j++) tmp = (tmp % M + dp[j] * dp[i - (j + 1) * 2] % M) % M; dp[i] = (tmp + dp[i - 1]) % M; } printf("%lld\n", dp[n]); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...