백준 1003. 피보나치 함수 :: 돼지개발자

출저 : https://www.acmicpc.net/problem/1003

"DP"

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
 
public class Main {
 
    static int T,N;
    static int z, o;
    static int dp[][];
    static StringBuilder sb = new StringBuilder();
    
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        
        T = Integer.parseInt(br.readLine());
        dp = new int [41][2];
        
        dp[0][0] = 1;
        dp[0][1] = 0;
        
        dp[1][0] = 0;
        dp[1][1] = 1;
        
        for (int i = 2; i <= 40; i++) {
            dp[i][0] = dp[i-1][0] + dp[i-2][0];
            dp[i][1] = dp[i-1][1] + dp[i-2][1];
        }
        
        while(T-- > 0) {
            N  = Integer.parseInt(br.readLine());
            sb.append(dp[N][0]+" "+dp[N][1]+"\n");
        }
        System.out.print(sb.toString());
    }
    
}