Cod sursa(job #307571)
Utilizator | Data | 24 aprilie 2009 14:05:25 | |
---|---|---|---|
Problema | Sandokan | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include<stdio.h>
#define MOD 2000003
int n,k,i,j;
long long a[5000][5000];
int main()
{
freopen("sandokan.in","r",stdin);
freopen("sandokan.out","w",stdout);
scanf("%d %d",&n,&k);
n--;k--;
for(i=0;i<=n;i++)
a[i][0]=1;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
a[i][j]=(a[i-1][j]+a[i-1][j-1]) % MOD;
printf("%lld",a[n-1][k-1]%MOD);
return 0;
}