Pagini recente » Cod sursa (job #603526) | Cod sursa (job #3152892) | Cod sursa (job #2289774) | Cod sursa (job #1643054) | Cod sursa (job #26649)
Cod sursa(job #26649)
#include <stdio.h>
#define MOD 666013
int N, K, a, b;
int sol = 1;
int fact(int nr)
{
int i, rez = 1;
if (nr == 0) return 1;
for (i = 1; i <= nr; i++) rez = (rez * i) % MOD;
return (rez % MOD);
}
int put(int nr, int p)
{
int i, rez = 1;
if (p == 0) return 1;
for (i = 1; i <= p; i++) rez = (rez * nr) % MOD;
return (rez % MOD);
}
int main()
{
freopen("kperm.in", "r", stdin);
freopen("kperm.out", "w", stdout);
scanf("%d %d", &N, &K);
b = N % K;
a = K - b;
if (N % 2 == 0) { printf("0\n"); return 0; }
sol = ( sol * fact(a) ) % MOD;
sol = ( sol * fact(b) ) % MOD;
sol = ( sol * put(fact((N/K) + 1), b) ) % MOD;
sol = ( sol * put(fact(N/K), a) ) % MOD;
printf("%d\n", sol % MOD);
return 0;
}