9507번 - Generations of Tribbles

https://www.acmicpc.net/problem/9507

9507번: Generations of Tribbles

#include <iostream>
using namespace std;
long long koongarr[68]; //꿍 피보나치 담을 배열

void koong(int n)
{
    koongarr[0] = 1; //n==0
    koongarr[1] = 1; //n==1
    koongarr[2] = 2; //n==2
    koongarr[3] = 4; //n==3
    //n>=4
    for (int i = 4; i <= n; i++)
        koongarr[i] = koongarr[i - 1] + koongarr[i - 2] + koongarr[i - 3] + koongarr[i - 4];
    cout << koongarr[n] << '\n';
}
int main() {
    int N;
    cin >> N;
    int arr[N]; //몇 번째 꿍 피보나치를 구해야 하는지 저장할 배열
    for (int i = 0; i < N; i++)
    {
        cin >> arr[i]; //
    }


    for (int i = 0; i < N; i++)
        koong(arr[i]); //koong() 호출
    return 0;
}