백준 9461 파도반수열

#include <iostream>
#include <algorithm>
using namespace std;
long long p[101];
int main() {
	p[0] = 1;
	p[1] = 1;
	p[2] = 1;
	p[3] = 2;
	p[4] = 2;
	for (int i = 5; i < 100; i++) {
		p[i] = p[i - 5] + p[i - 1];
	}
	int testcase;
	cin >> testcase;
	while (testcase > 0) {
		testcase--;
		int n = 0;
		cin >> n;
		cout << p[n - 1] << endl;
	}
}

P[n] = P[n-5] + P[n-1]