Pagini recente » Cod sursa (job #2673204) | Cod sursa (job #2915391) | Cod sursa (job #330634) | Cod sursa (job #636935) | Cod sursa (job #1959752)
#include <bits/stdc++.h>
#define M 2000003
using namespace std;
ifstream f("sandokan.in");
ofstream g("sandokan.out");
long long fct[5001];
long long put(long long a, long long n)
{
long long r=1;
while(n)
{
if(n%2)
r=(r*a)%M;
n/=2;
a=(a*a)%M;
}
return r;
}
int main()
{long long n,k,p1,p2,inv,i;
f>>n>>k;
n--;
k--;
fct[0]=1;
for(i=1;i<=n;i++)
fct[i]=(i*fct[i-1])%M;
p1=fct[n];
p2=(fct[k]*fct[n-k])%M;
p2=put(p2,M-2);
g<<(p1*p2)%M;
return 0;
}