Pagini recente » Cod sursa (job #3291635) | Cod sursa (job #2266652) | Cod sursa (job #1476555) | Cod sursa (job #2056811) | Cod sursa (job #25560)
Cod sursa(job #25560)
#include<stdio.h>
const int Nmax=100;
int P[Nmax],v[Nmax],N,K,NR;
void cit()
{
freopen("kperm.in","r",stdin);
scanf("%d%d",&N,&K);
}
void back (int k )
{
int i, j, s=0, ok=1 ;
if(k>N)
{
for(i=1;i<=N-K+1;i++)
{
s=0;
for(j=i;j<=i+K-1;j++)
s+=P[j];
if(s%3!=0)
ok=0;
}
if(ok)
NR++;
}
else
for(i=1;i<=N;i++)
if(v[i]==0)
{
v[i]=1;
P[k]=i;
back(k+1);
v[i]=0;
}
}
void scr()
{
printf("%d\n",NR);
}
int main()
{
freopen("kperm.out","w",stdout);
int i,j,k;
cit();
for(i=1;i<=N;i++)
{
P[1]=i;
v[i]=1;
back(2);
v[i]=0;
}
scr();
fclose(stdout);
return 0;
}