Cod sursa(job #1730099)
Utilizator | Data | 16 iulie 2016 12:54:39 | |
---|---|---|---|
Problema | Sandokan | Scor | 5 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.63 kb |
#include<iostream>
#include<fstream>
#define MOD 2000003
using namespace std;
int lgput(int baza, int p)
{
if(p==1)
return baza;
if(p%2==0)
return lgput((baza*baza)%MOD,p/2);
else return (baza*lgput(baza,p-1))%MOD;
}
int n,k,sol,nr;
int main()
{
ifstream cin("sandokan.in");
ofstream cout("sandokan.out");
cin>>n>>k;
n--;
k--;
sol=nr=1;
for(int i=1;i<=n;i++)
{
if(i>k)
nr=(nr*i)%MOD;
if(i<=n-k)
sol=(sol*i)%MOD;
}
sol=lgput(sol,MOD-2);
sol=(sol*nr)%MOD;
cout<<sol;
return 0;
}