Pagini recente » Istoria paginii runda/rar3 | Cod sursa (job #1656645) | Istoria paginii runda/simulare-cartita-41/clasament | Istoria paginii runda/simulare_oji_2023_clasele_11_12_11_martie/clasament | Cod sursa (job #282368)
Cod sursa(job #282368)
#include<stdio.h>
#define INPUT "kperm.in"
#define OUTPUT "kperm.out"
const long MOD = 666013;
FILE *fin = fopen(INPUT, "r"), *fout = fopen(OUTPUT, "w");
int N, K, R, C;
long Sum, P;
int main()
{
fscanf(fin, "%d %d", &N, &K);
Sum = 1;
if( K % 2 )
{
R = N % K;
C = N / K;
P = 1;
for(int i = 1; i <= R; ++i)
P = (P * (i % MOD)) % MOD;
Sum = (Sum * P) % MOD;
P = 1;
for(int i = 1; i <= K-R; ++i)
P = (P * (i % MOD)) % MOD;
Sum = (Sum * P) % MOD;
P = 1;
for(int i = 1; i <= C+1; ++i)
P = (P * (i % MOD)) % MOD;
for(int i = 2; i <= R; ++i)
P = ((P % MOD) * (P % MOD)) % MOD;
Sum = (Sum * P) % MOD;
P = 1;
for(int i = 1; i <= C; ++i)
P = (P * (i % MOD)) % MOD;
for(int i = 2; i <= K-R; ++i)
P = ((P % MOD) * (P % MOD)) % MOD;
Sum = (Sum * P) % MOD;
}
fprintf(fout, "%ld\n", Sum);
fclose(fin);
fclose(fout);
return 0;
}