* 문제 https://www.acmicpc.net/problem/1003 * 풀이https://github.com/stack07142/BOJ/blob/master/BOJ%231003_FibonacciCount/src/Main.kt var dp = Array(41) { Node() } fun main(args: Array) { var T = readLine()!!.toInt() while (T-- > 0) { val N = readLine()!!.toInt() fibonacci(N) println("${dp[N].count0} ${dp[N].count1}") } } fun fibonacci(n: Int): Node { if (dp[n].num != -1) { return dp[n] } when (n) {..