BEAKJOON JAVA ALGORITHM #11057(오르막수)

https://www.acmicpc.net/problem/11057

import java.util.Scanner; public class a11057 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int num = sc.nextInt(); long[][] arr = new long[num+1][10]; for(int i=0; i<=9; i++) { arr[1][i] = 1; } for(int i=2; i<=num; i++) { for(int j=0; j<=9; j++) { for(int p=j; p<=9; p++) { arr[i][j] += arr[i-1][p]; } arr[i][j] %= 10007; } } long sum = 0; for(int i=0; i<=9; i++) { sum += arr[num][i]; } sum %= 10007; System.out.println(sum); } }