Pagini recente » Autentificare | Cod sursa (job #1058448) | Cod sursa (job #2010427) | Cod sursa (job #2875931) | Cod sursa (job #282371)
Cod sursa(job #282371)
#include<stdio.h>
#define INPUT "kperm.in"
#define OUTPUT "kperm.out"
#define LL long long
const long MOD = 666013;
FILE *fin = fopen(INPUT, "r"), *fout = fopen(OUTPUT, "w");
LL N, K, R, C;
LL Sum, P;
int main()
{
fscanf(fin, "%lld %lld", &N, &K);
Sum = 1;
if( K % 2 )
{
R = N % K;
C = N / K;
P = 1;
for(LL i = 1; i <= R; ++i)
P = (P * (i % MOD)) % MOD;
Sum = (Sum * P) % MOD;
P = 1;
for(LL i = 1; i <= K-R; ++i)
P = (P * (i % MOD)) % MOD;
Sum = (Sum * P) % MOD;
P = 1;
for(LL i = 1; i <= C+1; ++i)
P = (P * (i % MOD)) % MOD;
for(LL i = 2; i <= R; ++i)
P = ((P % MOD) * (P % MOD)) % MOD;
Sum = (Sum * P) % MOD;
P = 1;
for(LL i = 1; i <= C; ++i)
P = (P * (i % MOD)) % MOD;
for(LL i = 2; i <= K-R; ++i)
P = ((P % MOD) * (P % MOD)) % MOD;
Sum = (Sum * P) % MOD;
}
fprintf(fout, "%lld\n", Sum);
fclose(fin);
fclose(fout);
return 0;
}