Pagini recente » Cod sursa (job #2435645) | Cod sursa (job #2436631) | Cod sursa (job #1942966) | Cod sursa (job #2848848) | Cod sursa (job #255074)
Cod sursa(job #255074)
#include<stdio.h>
#define N 20
int n,sol[N],a,num;
bool oc[N];
void afis()
{
for (int i=1; i<=n; ++i)
printf("%d ",sol[i]);
printf("\n");
if (sol[n]==n)
{
++num;
oc[num]=true;
}
}
void back(int x)
{
if (x==n+1)
{
afis();
return;
}
for (int i=1; i<=a; ++i)
{
if (!oc[i]&&sol[x-1]<i)
{
oc[i]=true;
sol[x]=i;
back(x+1);
if (i>num)
oc[i]=false;
}
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&a,&n);
back(1);
return 0;
}