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[1] = 1, dp[2] = 2;
sum[1][1] = 1, sum[0][2] = 3;
for(i = 3; i <= n; i++)
{
dp[i] = (dp[i - 1] + sum[i % 2][i - 2]) % M;
sum[i % 2][i] = (sum[i % 2][i - 2] + dp[i]) % M;
}
printf("%lld\n", dp[n]);
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |