(11057)(DP) 백준 오르막 수

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

풀이

---

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
 
int main() {
    int arr[1001][11] = { 0 };
    int N;
    int total =0;
    for (int i = 1; i <= 10; i++) {
        arr[1][i] = 1;
    }
 
    scanf("%d", &N);
    for (int i = 1; i <= N; i++) {
        for (int j = 1; j <= 10; j++) {
            for (int k = 1; k <= j; k++){
                arr[i][j] += arr[i - 1][k]%10007;
            }
        }
    }
    
    for (int i = 1; i <= 10; i++) {
        total += arr[N][i];
    }
    printf("%d", total%10007);
    
    return 0;
}