Pagini recente » Cod sursa (job #1825670) | Cod sursa (job #2160134) | Cod sursa (job #3158235) | Cod sursa (job #2634074) | Cod sursa (job #782037)
Cod sursa(job #782037)
#include<cstdio>
#include<cmath>
using namespace std;
int factorial(int n)
{
return (n == 1 || n == 0) ? 1 : factorial(n - 1) * n;
}
int main()
{
freopen("kperm.in","r",stdin);
freopen("kperm.out","w",stdout);
int n,k,c,r;
scanf("%d %d",&n,&k);
if(n%2==0)printf("0");
else
{
c=n/k;
r=n%k;
printf("%d",(int)(factorial(r)*factorial(k-r)*pow((double)factorial(c+1),r)*pow((double)factorial(c),k-r))%666013);
}
return 0;
}