Pagini recente » Cod sursa (job #83470) | Cod sursa (job #1584026) | Cod sursa (job #1960742) | Cod sursa (job #2280138) | Cod sursa (job #3281038)
#include <bits/stdc++.h>
using namespace std;
ifstream in("sandokan.in");
ofstream out("sandokan.out");
const int N = 5e3 + 5, MOD = 2e6 + 3;
int v[N], fact[N];
void precalc_fact(int n){
fact[1] = 1;
for(int i = 2; i <= n; i++){
fact[i] = fact[i-1] * i % MOD;
}
}
int lgpow(int base, int exp){
if(exp == 0)
return 1;
if(exp % 2)
return base * lgpow(base, exp - 1) % MOD;
return lgpow(base, exp / 2) * lgpow(base, exp / 2) % MOD;
}
int comb(int n, int k){
if(k == 0)
return 1;
return fact[n] * lgpow(fact[k] * fact[n-k] % MOD, MOD - 2) % MOD;
}
int main()
{
int n, k;
in >> n >> k;
precalc_fact(n);
out << comb(n - 1, (n - 1) % (k - 1));
return 0;
}