[백준 11057, Java] 오르막 수

문제

www.acmicpc.net/problem/11057

11057번: 오르막 수

 

check

 

코드

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;

public class Main {
    public static int N;
    public static int[][] ascendingNums;
    public static int MOD = 10007;
    public static void main(String[] args) throws Exception{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));

        N = Integer.parseInt(br.readLine());
        ascendingNums = new int[N+1][10]; //길이가 N인 오르막 수 중 끝자리가 M인 것의 경우의 수

        calculateCount();
        int result = getCount();

        bw.write(String.valueOf(result));
        bw.flush();

        br.close();
        bw.close();
    }

    public static void calculateCount(){
        for(int n = 1; n<=N; n++){
            if(n ==1){
                for(int index = 0 ; index<ascendingNums[n].length; index++){
                    ascendingNums[n][index] =1;
                }
            }
            else{
                for(int index = 0 ; index<ascendingNums[n].length; index++){
                    for(int j= 0 ; j<=index; j++){
                        ascendingNums[n][index] += ascendingNums[n-1][j];
                    }
                    ascendingNums[n][index] %= MOD;
                }
            }
        }
    }

    public static int getCount(){
        int result = 0;
        for(int index = 0 ; index<ascendingNums[N].length; index++){
            result += ascendingNums[N][index];
        }

        return result%MOD;
    }
}