rt,玄1关
code:
#include<bits/stdc++.h>
using namespace std;
int n,k,a[100005]={0,1};
int f(int x){
if(x==0)return 0;
if(x==1)return 1;
int sum=0;
if(a[x]!=0)return a[x]%100003;
for(int i=max(0,x-k);i<x;i++)
{
sum+=f(i)%100003;
}
a[x]=sum%100003;
return sum%100003;
}
int main()
{
cin>>n>>k;
cout<<f(n);
}