BOJ1003: 피보나치 함수(Silver 3)

#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string.h>

long long fibo0[41] = {
    0,
};
long long fibo1[41] = {
    0,
};
void fibonacci(int n)
{
    fibo0[0] = 1;
    fibo0[1] = 0;
    fibo1[0] = 0;
    fibo1[1] = 1;
    for (int i = 2; i <= n; i++)
    {
        fibo0[i] = fibo0[i - 1] + fibo0[i - 2];
        fibo1[i] = fibo1[i - 1] + fibo1[i - 2];
    }
}

int main()
{
    long long T;
    scanf("%lld", &T);
    for (long long i = 0; i < T; i++)
    {
        int a;
        scanf("%d", &a);
        fibonacci(a);
        printf("%lld %lld\n", fibo0[a], fibo1[a]);
    }
}