1003 피보나치 함수

#include <stdio.h>
 
typedef struct fib {
    int aNum = 0;
    int bNum = 0;
};
 
int main() {
    int t;
    scanf("%d", &t);
            
    while (t--) {
        int n;
        scanf("%d", &n);
 
        fib arr[50];
        arr[0].aNum = 1;    arr[0].bNum = 0;
        arr[1].aNum = 0;    arr[1].bNum = 1;
 
        if (n == 0) {
            printf("%d %d\n", arr[0].aNum, arr[0].bNum);
            continue;
        }
        else if (n == 1) {
            printf("%d %d\n", arr[1].aNum, arr[1].bNum);
            continue;
        }
 
        for (int i = 2; i <= n; i++) {
            arr[i].aNum = arr[i - 1].aNum + arr[i - 2].aNum;
            arr[i].bNum = arr[i - 1].bNum + arr[i - 2].bNum;
        }
 
        printf("%d %d\n", arr[n].aNum, arr[n].bNum);
    }
}