Pagini recente » Cod sursa (job #1868706) | Cod sursa (job #2471100) | Cod sursa (job #2930981) | Cod sursa (job #762200) | Cod sursa (job #68685)
Cod sursa(job #68685)
#include<stdio.h>
#define Nm 5001
#define Mod 666013
int n,k;
void read()
{
freopen("kperm.in","r",stdin);
scanf("%d%d",&n,&k);
}
int solve()
{
int F[Nm],i,a,b,sol;
if(k%2==0)
return 0;
F[0]=1;
for(i=1;i<=n;++i)
F[i]=F[i-1]*(long long)i%Mod;
a=n%k; b=k-a;
sol=(long long)F[a]*F[b]%Mod;
for(i=0;i<a;++i)
sol=(long long)sol*F[n/k+1]%Mod;
for(i=0;i<b;++i)
sol=(long long)sol*F[n/k]%Mod;
return sol;
}
void write(int sol)
{
freopen("kperm.out","w",stdout);
printf("%d\n",sol);
}
int main()
{
read();
write(solve());
return 0;
}