Pagini recente » Cod sursa (job #377734) | Cod sursa (job #862752) | Cod sursa (job #2518289) | Cod sursa (job #1341907) | Cod sursa (job #2271223)
#include <cstdio>
using namespace std;
const int mod=666013;
int fact[5010];
int main()
{
freopen("kperm.in","r",stdin);
freopen("kperm.out","w",stdout);
int n,k;
scanf("%d%d",&n,&k);
if(k%2==0) {printf("0");return 0;}
fact[0]=1;
for(int i=1;i<=n;i++) fact[i]=(1LL*fact[i-1]*i)%mod;
int a=n%k;
int b=k-a;
int sol=1LL*fact[a]*fact[b]%mod;
for(int i=1;i<=a;i++) sol=1LL*sol*fact[n/k+1]%mod;
for(int i=1;i<=b;i++) sol=1LL*sol*fact[n/k]%mod;
printf("%d",sol);
return 0;
}