Pagini recente » Cod sursa (job #781335) | Cod sursa (job #1288360) | Cod sursa (job #1930802) | Cod sursa (job #2748046) | Cod sursa (job #1533170)
#include <iostream>
#include <cstdio>
using namespace std;
int n,v[17],viz[17];
void afis (int l)
{
for (int i=1;i<l;++i)
printf("%d ",v[i]);
if (l>1)
printf("\n");
}
void solve(int k)
{
afis(k);
for (int i=1;i<=n;++i)
if (!viz[i] && i>v[k-1])
{
viz[i]=1;
v[k]=i;
solve(k+1);
viz[i]=0;
}
}
int main()
{
freopen("submultimi.in","r",stdin);
freopen("submultimi.out","w",stdout);
scanf("%d",&n);
solve(1);
return 0;
}