Pagini recente » Cod sursa (job #1534143) | Cod sursa (job #2308701) | Cod sursa (job #2201711) | Cod sursa (job #1204392) | Cod sursa (job #1312780)
#include <fstream>
#define MODULO 666013
using namespace std;
long long factorial(long long n)
{
long long k=1;
for(long long i=1; i<=n; ++i)
k=k*i%MODULO;
return k;
}
long exponential(long long n, long long pow)
{
long long k=1;
for(long long i=0; i<pow; ++i)
k=k*n%MODULO;
return k;
}
int main()
{
ifstream in("kperm.in");
ofstream out("kperm.out");
long long n, k, ax;
in>>n>>k;
if((k*(k+1)/2)%k)
out<<"0\n";
else
{
ax=factorial(n/k);
out<<(((factorial(n%k)*exponential(ax+1, n%k))%MODULO)*((factorial(k-n%k)*exponential(ax, k-n%k))%MODULO))%MODULO<<'\n';
}
in.close(); out.close();
return 0;
}