Cod sursa(job #657081)
Utilizator | Data | 5 ianuarie 2012 19:11:10 | |
---|---|---|---|
Problema | Sandokan | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.35 kb |
#include<cstdio>
#define mod 2000003
long long n,k,p;
int fact(int n){
int i,w=1;
for(i=2;i<=n;i++)
w*=i;
return w;
}
int main (){
freopen("sandokan.in","r",stdin);
freopen("sandokan.out","w",stdout);
scanf("%lld%lld",&n,&k);
p=1;
while(n>=k){
p*=fact(n)/(fact(n-k)*fact(k))%mod;
n-=2;
}
printf("%lld",p%mod);
return 0;
}