Cod sursa(job #340257)
Utilizator | Data | 13 august 2009 20:52:54 | |
---|---|---|---|
Problema | Sandokan | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include<stdio.h>
#include<string.h>
#define mod 2000003
int n,p,k;
int v[3][5004];
int main()
{
freopen("sandokan.in","r",stdin);
freopen("sandokan.out","w",stdout);
scanf("%d%d",&n,&k);
int i,j;
p=n%(k-1);
n--;
if(p==0)
p=k-2;
else
p--;
v[0][0]=1;
for(i=1;i<=n;i++)
{
v[i&1][0]=1;
for(j=1;j<=p;j++)
v[i&1][j]=(v[i-1&1][j-1]+v[i-1&1][j])%mod;
}
printf("%d\n",v[n&1][p]);
return 0;
}