제출 #19893

#제출 시각아이디문제언어결과실행 시간메모리
19893king7282괄호 (kriii4_R)C++98
0 / 100
6 ms24520 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[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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...