[C++] [DP] 백준 11725번 : 2xN 타일링

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

11726번: 2×n 타일링

#include<iostream>
using namespace std;
int tail[1001];

int dp(int n) {
	if (n == 1)	return 1;
	if (n == 2)	return 2;
	if (tail[n] != 0)	return tail[n];
	return tail[n] = (dp(n - 1) + dp(n - 2)) % 10007;
}

int main(void) {
	int n;
	cin >> n;
	cout << dp(n) << endl;
}