Pagini recente » Cod sursa (job #2731684) | Cod sursa (job #1211339) | Cod sursa (job #1353296) | Cod sursa (job #1114568) | Cod sursa (job #657851)
Cod sursa(job #657851)
#include<cstdio>
#define lim 200000003
#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);
int t=comb(n-1,(n-1)%(k-1));
printf("%d ",t);
return 0;
}