11727번: 2xn 타일링 2

https://www.acmicpc.net/problem/11727

풀이

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <vector>

using namespace std;

int Dynamic[1001];

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);

	//freopen("input.txt", "rt", stdin);

	int n{};
	cin >> n;

	Dynamic[0] = 0;
	Dynamic[1] = 1;
	Dynamic[2] = 3;

	for (int i = 3; i < 1001; ++i)
	{
		Dynamic[i] = (Dynamic[i - 1] + Dynamic[i - 2] + Dynamic[i - 2]) % 10007;
	}

	cout << Dynamic[n];

	return 0;
}