Pagini recente » Cod sursa (job #1470676) | Cod sursa (job #2226143) | Cod sursa (job #1529378) | Cod sursa (job #2820055) | Cod sursa (job #1445923)
#include <cstdio>
#include <algorithm>
#include <cstring>
#define mod 666013
#define Nmax 5005
using namespace std;
int n, i, j, k;
long long f[Nmax], sol;
int main()
{
freopen("kperm.in", "r", stdin);
freopen("kperm.out", "w", stdout);
scanf("%d %d", &n, &k);
f[0] = 1;
for (i = 1; i <= n; ++ i)
f[i] = (f[i - 1] * i) % mod;
if (k % 2 == 0)
{
printf("0");
return 0;
}
sol = (f[n % k] * f[k - (n % k)]) % mod;
for (i = 1; i <= n % k; ++ i)
sol = (sol * f[(n / k) + 1]) % mod;
for (i = 1; i <= k - (n % k); ++ i)
sol = (sol * f[n / k]) % mod;
printf("%d", sol);
return 0;
}