[Java/백준]1003번: 피보나치 함수

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {
	static int cnt_zero;
	static int cnt_one;
	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		int t = Integer.parseInt(br.readLine());;	// 테스트 케이스 개수

		int[] arr = new int[t];

		for(int i=0; i<t; i++) {
			arr[i] = Integer.parseInt(br.readLine());
		}

		for(int i=0; i<t; i++) {
			fibonacci(arr[i]);
			System.out.println(cnt_zero + " " + cnt_one);
			cnt_zero = 0;
			cnt_one = 0;
		}
		br.close();
	}

	public static int fibonacci(int n) {
		if(n == 0) {
			cnt_zero++;
			return 0;
		}else if(n == 1) {
			cnt_one++;
			return 1;
		}else {
			return fibonacci(n-1) + fibonacci(n-2);
		}
	}
}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {

	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		int t = Integer.parseInt(br.readLine());;	// 테스트 케이스 개수

		int[] arr = new int[t];

		for(int i=0; i<t; i++) {
			arr[i] = Integer.parseInt(br.readLine());
		}

		int[][] fibonacciSet = new int[41][2];

		fibonacciSet[0][0] = 1;
		fibonacciSet[0][1] = 0;
		fibonacciSet[1][0] = 0;
		fibonacciSet[1][1] = 1;

        for (int i = 2; i < fibonacciSet.length; i++) {
            fibonacciSet[i][0] = fibonacciSet[i - 1][1];
            fibonacciSet[i][1] = fibonacciSet[i - 1][0] + fibonacciSet[i - 1][1];
        }

        for (int input : arr) {
            System.out.println(fibonacciSet[input][0] + " " + fibonacciSet[input][1]);
        }
	}
}