Pagini recente » Cod sursa (job #2731710) | Cod sursa (job #2512093) | Cod sursa (job #1609687) | Cod sursa (job #2532375) | Cod sursa (job #657862)
Cod sursa(job #657862)
#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=i;j>=1;--j){
a[j]=(a[j]+a[j-1])%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;
}