2 x n 타일링

#include <string>
#include <vector>

using namespace std;
const int MAX = 60001;
int MOD = 1000000007;
int dp[MAX];

int solution(int n) {
	dp[1] = 1;
	dp[2] = 2;

	for (int i = 3; i <= n; i++) {
		dp[i] = (dp[i - 1] + dp[i - 2]) % MOD;
	}
	return dp[n];
}