[code.plus 알고리즘 기초] no. 11057

package n11057;
 
import java.util.Scanner;
 
public class Main {
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
 
        int n = sc.nextInt();
        long[][] dp = new long[n+1][11];
 
        for(int i = 0; i < 10; i++){
            dp[1][i] = 1;
        }
 
        for(int i = 2; i < n+1; i++){
            for(int j = 0; j < 10; j++){
                for(int k = 0; k < 10; k++){
                    if( j - k >= 0){
                        dp[i][j] += dp[i-1][j-k];
                    }
                }
//                dp[i][j] += dp[i-1][j];
                dp[i][j] %= 10007;
            }
        }
 
        long result = 0;
        for(int i = 0; i<10; i++){
            result += dp[n][i];
        }
        result = result%10007;
        System.out.println(result);
    }
}