Pagini recente » Cod sursa (job #606442) | Cod sursa (job #1336658) | Cod sursa (job #2885481) | Cod sursa (job #2236697) | Cod sursa (job #1744940)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("sandokan.in");
ofstream cout("sandokan.out");
const int MOD = 2000003;
long long Power(long long base, long long power) {
long long answer = 1;
while (power) {
if (power % 2)
answer = (answer * base) % MOD;
base = (base * base) % MOD;
power /= 2;
}
return answer;
}
int main() {
int n, k;
cin >> n >> k;
long long answer = 1;
for (int i = 1; i <= n % k; i++)
answer = answer * (n - i + 1) % MOD * Power(i, MOD - 2) % MOD;
cout << answer;
return 0;
}