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>
#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 time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |