Description:
Accept:
#include<iostream>
using namespace std;
const int maxn = 100003;
long long int n, k, f[maxn];
int main()
{
cin >> n >> k;
f[0] = 1;
f[1] = 1;
long long int tmp = k, tot = 0;
for (int i = 2; i <= n; i++)
{
for (int j = i - 1; j >= 0 && tmp > 0; j--)
{
tot =tot+ f[j] % maxn;
tmp--;
}
f[i] = tot % maxn;
tot = 0;
tmp = k;
}
cout << f[n]%maxn << endl;
return 0;
}