Pagini recente » Cod sursa (job #2218202) | Cod sursa (job #2525772) | Cod sursa (job #2701534) | Cod sursa (job #1118094) | Cod sursa (job #657857)
Cod sursa(job #657857)
#include<cstdio>
#define lim 5005
#define mod 2000003
int a[lim],n,k;
int comb(int n,int k){
a[0]=1;
if(k>n)
return 1;
for(int i=1;i<=n;++i)
for(int j=1;j<=i;++j){
a[j]=a[j]+a[j-1];
if(a[j]>=mod)
a[j]-=mod;
}
return a[k];
}
int main (){
freopen("sandokan.in","r",stdin);
freopen("sandokan.out","w",stdout);
scanf("%d%d",&n,&k);
printf("%d\n",comb(n-1,(n-1)%(k-1)));
return 0;
}