Pagini recente » Cod sursa (job #238988) | Cod sursa (job #2374114) | Cod sursa (job #2875163) | Cod sursa (job #497900) | Cod sursa (job #193285)
Cod sursa(job #193285)
#include <stdio.h>
int n,k,i,j,a[2][5001],p;
int main()
{
freopen("sandokan.in","r",stdin);
freopen("sandokan.out","w",stdout);
scanf("%d%d",&n,&k);
k=(--n)%(k-1);
a[0][0]=1; a[1][0]=1;
for (i=1, p=0; i<=n; ++i, p=1-p)
{
for (j=1; j<=k; ++j)
{
if (j==i) { a[p][j]=1; break; }
a[p][j]=(a[1-p][j-1]+a[1-p][j])%2000003;
}
}
printf("%d\n",a[p][k]);
return 0;
}