Pagini recente » Cod sursa (job #732098) | Cod sursa (job #667532) | Cod sursa (job #1556468) | Cod sursa (job #1126321) | Cod sursa (job #82733)
Cod sursa(job #82733)
Utilizator |
|
Data |
8 septembrie 2007 18:10:02 |
Problema |
Kperm |
Scor |
20 |
Compilator |
cpp |
Status |
done |
Runda |
Arhiva de probleme |
Marime |
1.54 kb |
using namespace std;
#define ll long long
#include <stdio.h>
FILE *fin=fopen("kperm.in","r"),
*fout=fopen("kperm.out","w");
int n,k,r,c;
ll sol,MOD;
int main()
{
MOD=666013;
fscanf(fin,"%d %d",&n,&k);
if (k%2==0)
{
fprintf(fout,"0\n");
return 0;
}
else
{
int i;
ll fact=1; sol=1;
c=n/k; r=n%k;
for (i=2; i<=r; i++)
{
fact=(long long)(fact*i);
if (fact>MOD) fact-=MOD;
}
sol=(long long)(sol*fact);
if (sol>MOD) sol-=MOD;
fact=1;
for (i=2; i<=k-r; i++)
{
fact=(long long)(fact*i);
if (fact>MOD) fact-=MOD;
}
sol=(long long)(sol*fact);
if (sol>MOD) sol-=MOD;
fact=1;
for (i=2; i<=c+1; i++)
{
fact=(long long)(fact*i);
if (fact>MOD) fact-=MOD;
}
ll p=fact;
for (i=2; i<=r; i++)
{
fact=(long long)(fact*p);
if (fact>MOD) fact-=MOD;
}
if (r==0) fact=1;
sol=(long long)(sol*fact);
if (sol>MOD) sol-=MOD;
fact=1;
for (i=1; i<=c; i++)
{
fact=(long long)(fact*i);
if (fact>MOD) fact-=MOD;
}
p=fact;
for (i=1; i<=k-r; i++)
{
fact=(long long)(fact*p);
if (fact>MOD) fact-=MOD;
}
// if (k-r==0) fact=1;
sol=(long long)(sol*fact);
if (sol>MOD) sol-=MOD;
fprintf(fout,"%lld\n",( long long )sol);
}
return 0;
}