Pagini recente » Cod sursa (job #1427011) | Cod sursa (job #1170996) | Cod sursa (job #3255863) | Cod sursa (job #1411027) | Cod sursa (job #1455892)
#include <cstdio>
#include <iostream>
#include <vector>
#include <set>
#include <cmath>
#define mod 666013
using namespace std;
int fact (int a) {
int ans = 1;
for (int i = 2; i <= a; i++) {
ans = (ans * i) % mod;
}
return ans;
}
int put (int b, int e) {
int ans = 1;
while (e > 0) {
if (e % 2 == 1) {
ans = (ans * b) % mod;
}
b = (b * b) % mod;
e /= 2;
}
return ans;
}
int main() {
freopen("kperm.in", "r", stdin);
freopen("kperm.out", "w", stdout);
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
if (k % 2 == 0) {
cout << 0;
return 0;
}
int a = n % k;
int b = n / k;
int ans = (fact(a) * fact(k - a)) % mod;
int f1 = fact(b);
int f2 = (f1 * (b + 1)) % mod;
for (int i = 0; i < a; i++) {
ans = (ans * f2) % mod;
}
for (int i = 0; i < k - a; i++) {
ans = (ans * f1) % mod;
}
// ans = (ans * fact(a)) % mod;
//ans = (ans * fact(k - a)) % mod;
//ans = (ans * put(fact(b + 1), a)) % mod;
//ans = (ans * put(fact(b), k - a)) % mod;
cout << ans;
return 0;
}