Lv3_타일장식물.cpp

#include <string>
#include <vector>

using namespace std;

long long solution(int N) {
	long long d[81];
	long long s[81];
	d[0] = 0;
	d[1] = 1;
	s[1] = 4 * d[1];
	for (int i = 2; i <= N; i++) {
		d[i] = d[i - 1] + d[i - 2];
		s[i] = s[i - 1] - d[i] + d[i] * 3;
	}
	long long answer = s[N];
	return answer;
}