Pagini recente » Cod sursa (job #1797209) | Cod sursa (job #1629191) | Cod sursa (job #2546253) | Cod sursa (job #780899) | Cod sursa (job #2157377)
#include<fstream>
using namespace std;
ifstream in ("sandokan.in");
ofstream out ("sandokan.out");
const int mod = 2000003;
int n,k,sol,fact,nfact,xfact,nxfact,a,x;
int main (void) {
in >> n >> k;
x = (n) % (k-1);
if (n == k) {
out << 1;
return 0;
}
if (x == 0) {
x = k-1;
}
fact = 1;
for (int i = 1; i <= n; i ++) {
fact = (fact * i) % mod;
if (i == n) {
nfact = fact;
}
if (i == x) {
xfact = fact;
}
if (i == n-x) {
nxfact = fact;
}
}
sol = nfact;
a = (nxfact * xfact*1LL) % mod;
for (int i = 1; i <= mod-2; i ++) {
sol = (sol * a) % mod;
}
out << sol;
return 0;
}