BOJ)11057 오르막수(다시보기)

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

#include <iostream>
using namespace std;
#define MOD 10007
long long dp[1001][10];
int main()
{
    int N;
    cin >> N;
 
    for (int i = 0; i < 10; i++) {
        dp[1][i] = 1;
    }
 
    for (int i = 2; i <= N; i++) {
        for (int j = 0 ; j < 10; j++) {
            for (int k = 0; k <= j; k++) {
                dp[i][j] += dp[i - 1][k];
                dp[i][j] %= MOD;
            }
            
        }
        
    }
 
    long long res = 0;
    for(int i=0; i<10; i++){
        res += dp[N][i];
    }
    res %= MOD;
 
    cout << res;
}