Pagini recente » Cod sursa (job #2450826) | Istoria paginii runda/simulare1112judeteana | Cod sursa (job #1168448) | Cod sursa (job #1531771) | Cod sursa (job #1143154)
#include <cstdio>
using namespace std;
int n,i,a[20],sol[20];
void afis(int k)
{
for (i=1;i<=k;i++)
printf("%d ",a[sol[i]]);
printf("\n");
}
void backk(int k)
{
int i;
if (k<=n)
{
for (i=sol[k-1]+1;i<=n;i++)
{
sol[k]=i;
afis(k);
backk(k+1);
}
}
}
int main()
{
freopen("submultimi.in","r",stdin);
freopen("submultimi.out","w",stdout);
scanf("%d",&n);
for (i=1;i<=n;i++)
a[i]=i;
backk(1);
}