Cod sursa(job #448906)
Utilizator | Data | 4 mai 2010 22:38:41 | |
---|---|---|---|
Problema | Sandokan | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include<stdio.h>
#define MOD 2000003
int n,k,p,c[2][5003];
int main ()
{
int i,j;
freopen("sandokan.in","r",stdin);
freopen("sandokan.out","w",stdout);
scanf("%d%d",&n,&k);
p=n;
c[0][0]=1;c[1][0]=1;
while(p>=k)
{
p-=k;
p++;
}
for(i=1;i<n;i++)
for(j=1;j<p;j++)
c[i&1][j]=(c[(i+1)&1][j]+c[(i+1)&1][j-1])%MOD;
printf("%d",c[(n-1)&1][p-1]);
return 0;
}