백준 9095번 C++

#include <iostream>

using namespace std;

int n, m;

int way[11];

void findway(int m) {

way[1] = 1;

way[2] = 2;

way[3] = 4;

for (int i = 4; i <= m; i++) {

way[i] = way[i - 3] + way[i - 2] + way[i - 1];

}

cout << way[m] << endl;

}

int main(void) {

cin >> n;

for (int i = 0; i < n; i++) {

cin >> m;

findway(m);

}

}