Pagini recente » Cod sursa (job #852633) | Cod sursa (job #1918502) | Cod sursa (job #2933821) | Cod sursa (job #2907087) | Cod sursa (job #1528522)
#include <iostream>
#include <cstdio>
using namespace std;
int n,niv,k,x[20],viz[20];
void afis()
{
for (int i=1;i<=niv;++i)
printf("%d ",x[i]);
printf("\n");
}
void backt(int k,int j)
{
if (k==niv+1)
{
afis();
return;
}
for (int i=j;i<=n-niv+j;++i)
if (!viz[i])
{
x[k]=i;
viz[i]=1;
backt(k+1,j+1);
viz[i]=0;
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&niv);
backt(1,1);
return 0;
}