baekjun 9461. 파도반수열

 P[N] = P[N-2] + P[N-3]

#include <iostream>
 
using namespace std;
 
unsigned long long padovan[100];
 
int main() {
    padovan[0] = 1;
    padovan[1] = 1;
    padovan[2] = 1;
    int cases;
    cin >> cases;
    while (cases--) {
        int N;
        cin >> N;
        for (int i = 3; i < N; i++) {
            padovan[i] = padovan[i - 2] + padovan[i - 3];
        }
        cout << padovan[N - 1] << endl;
    }
    //system("pause");
    return 0;
}