Pagini recente » Cod sursa (job #3240322) | Cod sursa (job #1107123) | Cod sursa (job #711858) | Cod sursa (job #2327659) | Cod sursa (job #1249542)
#include <iostream>
#include <fstream>
using namespace std;
int a[100],b[100],p,nr,i,j,n,m,aux;
ifstream f("tudor.in");
ofstream g("tudor.out");
int main()
{
f>>n;
for (i=1; i<=n; i++)
{
a[i]=i;
}
for (i=1; i<=(1<<n)-1; i++)
{
nr=0;
aux=i;
while (aux!=0)
{
nr++;
p=aux%2;
if (p==1)
{
b[n+1-nr]=a[n+1-nr];
}
aux=aux/2;
}
for (j=1; j<=n; j++)
{
if (b[j]!=0)
{
g<<b[j]<<' ';
b[j]=0;
}
}
g<<'\n';
}
return 0;
}