Pagini recente » Cod sursa (job #443857) | Cod sursa (job #1017015) | Cod sursa (job #2046738) | Cod sursa (job #209428) | Cod sursa (job #1170499)
#include <fstream>
#include <algorithm>
using namespace std;
#define NMax 5005
#define MOD 666013
ifstream f("kperm.in");
ofstream g("kperm.out");
int n,k;
int fact[NMax];
int main()
{
int i;
f>>n>>k;
int p=n/k,r=n%k,rr;
if(r) p++;
if(!r) r=k;
rr=k-r;
int mfact=max(p,k);
fact[0]=1;
for(i=1;i<=mfact;i++) fact[i]=(fact[i-1]*i)%MOD;
long long rez=(fact[r]*fact[rr])%MOD;
for(i=1;i<=r;i++) rez=(rez*fact[p])%MOD;
for(i=1;i<=rr;i++) rez=(rez*fact[p-1])%MOD;
g<<rez<<"\n";
f.close();
g.close();
return 0;
}