Pagini recente » Cod sursa (job #1342215) | Cod sursa (job #1496075) | Cod sursa (job #1369805) | Cod sursa (job #232224) | Cod sursa (job #1258404)
#include<cstdio>
using namespace std;
#define MOD 666013
long long n,k,p,r,sol,F[5005];
int main()
{
long long i;
freopen("kperm.in","r",stdin);
freopen("kperm.out","w",stdout);
scanf("%lld%lld",&n,&k);
p=n/k, r=n%k;
for (i=1,F[0]=1;i<=k;++i)
F[i]=F[i-1]*i%MOD;
sol=F[r]*F[k-r]%MOD*F[r]%MOD;
if (r) sol*=F[p+1], sol%=MOD;
else sol*=F[p], sol%=MOD;
printf("%lld\n",sol);
return 0;
}