Pagini recente » Cod sursa (job #1212511) | Cod sursa (job #2083657) | Cod sursa (job #217233) | Cod sursa (job #2570364) | Cod sursa (job #2258280)
#include <fstream>
std::ifstream cin("sandokan.in");
std::ofstream cout("sandokan.out");
#define MOD 2000003
long long sol,pnumit=1,pnumar=1;
int n,k,numit,numar;
int main()
{
int i;
cin>>n>>k;
if(n==k||k==0){
cout<<1;
return 0;
}
if(n/2<(k-1)) //=>n-k<k
numar=k, numit=n-(k-1);
else
numar=n-k+2, numit=k-1;
for(;numar<=n;numar++)
pnumar=((pnumar*numar)%MOD);
for(i=2;i<=numit;i++)
pnumit=((pnumit*i)%MOD);
while(pnumar<pnumit)
pnumar+=MOD;
sol=pnumar/pnumit;
cout<<sol;
}