1003번 피보나치 함수

계산해보면 0은 fibonacci(num-1) 개수 만큼 1은 fibonacci(num)만큼 출력을 한다

 

#include <iostream>
#include <queue>

#define MAX 41

using namespace std;

int Test[MAX];

int fibonacci(int n) {
    if(n==-1){
        return 1;
    }
    if(n==0) {
        return 0;
    }
    if(n==1) {
        return 1;
    }
    if(Test[n]!=0) return Test[n];
    
    return Test[n] = fibonacci(n-1) + fibonacci(n-2);
    
}

int main(){
    int number;
    
    cin>>number;
    
    queue<int> q;
    
    for(int i=0;i<number;i++){
        int M;
        cin >> M;
        q.push(M);
    }
    
    while(!q.empty()){
        int num = q.front();
        q.pop();
//        if(num>0){
//            cout << fibonacci(num-1) << " " << fibonacci(num)<< endl;
//        }
//        else
//            cout << "1 0" << endl;
        cout << fibonacci(num-1) << " " << fibonacci(num)<< endl;
    }
}