백준 1003번: 피보나치 함수

import java.util.Scanner;
 
public class algo1_1003_fibonacci {
    
    private static int[][] arr = new int[41][2];
    
    public static void main(String[] args) {
    
        fibonacci();
        
        Scanner scanner = new Scanner(System.in);
        int testCase = scanner.nextInt();
        
        for(int i=0 ; i<testCase ; i++){
            int input = scanner.nextInt();
            if(input < 0 && input > 40)
                input = scanner.nextInt();    
            
            System.out.println(arr[input][0] + " " + arr[input][1]);
        }
        scanner.close();
    }
 
    public static void fibonacci(){
        
        arr[0][0] = 1;
        arr[1][1] = 1;
        
        for(int i=2 ; i<=40 ; i++){
            arr[i][0] = arr[i-1][0] + arr[i-2][0];
            arr[i][1] = arr[i-1][1] + arr[i-2][1];
        }
    }
}