Pagini recente » Cod sursa (job #2000203) | Borderou de evaluare (job #943669) | Cod sursa (job #862860) | Cod sursa (job #2325857) | Cod sursa (job #852081)
Cod sursa(job #852081)
#include <stdio.h>
#define MOD 2000003
int fact(int N)
{
int i, sol = 1;
for (i = 2; i <= N; i ++)
sol = sol * i % MOD;
return sol;
}
int inv(int N)
{
int i, sol = 1;
for (i = 1; i <= MOD - 2; i ++)
sol = sol * N % MOD;
return sol;
}
int main()
{
int N, K;
freopen("sandokan.in", "r", stdin);
freopen("sandokan.out", "w", stdout);
scanf("%d%d", &N, &K);
N --; K --;
long long res;
res = fact(N);
res = res * inv(fact(K)) % MOD;
res = res * inv(fact(N - K)) % MOD;
printf("%lld", res);
return 0;
}