백준/백준-C++
11057번: 오르막 수
Beabletoet
2017. 6. 6. 21:56
#include<cstdio>
long long num[1001][10];
int main()
{
int n;
for (int i = 0; i < 10; ++i)
num[1][i] = 1;
scanf("%d", &n);
for (int i = 2; i <= n; ++i)
for (int j = 0; j < 10; ++j)
for (int k = 0; k <= j; ++k)
num[i][j] = (num[i][j] + num[i - 1][k]) % 10007;
long long ans = num[n][0];
for (int i = 1; i < 10; ++i)
ans += num[n][i];
printf("%d", ans % 10007);
}