DP문제인데,
점화식만 찾아내면 금방 풀 수 있는 문제였다.
점화식 : dp[n] = dp[n-1] + dp[n-2]
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Solution11726 {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int N = Integer.parseInt(br.readLine());
int[] dp = new int[N+2];
dp[1] = 1;
dp[2] = 2;
for(int i = 3; i < N+1; i++) {
dp[i] = (dp[i-1] + dp[i-2]) % 10007;
}
System.out.println(dp[N]);
}
}