# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
19877 | king7282 | 괄호 (kriii4_R) | C++14 | 0 ms | 8896 KiB |
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];
int main(void)
{
ll i, n, k;
scanf("%lld %lld", &n ,&k);
dp[1] = 1, dp[2] = 2;
for(i = 3; i <= n; i++)
{
dp[i] = (dp[i - 1] + dp[i - 2]) % M;
if(i % 2 == 0)
dp[i] = (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... |