Pagini recente » Cod sursa (job #2751164) | Cod sursa (job #3197521) | Istoria paginii problema/iepuri2 | Monitorul de evaluare | Cod sursa (job #3292086)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("submultimi.in");
ofstream fout("submultimi.out");
int v[20],i,j,k,n,nr,t;
int main()
{ fin>>n;
nr=1<<n;
for(i=1;i<nr;i++)
{t=v[1]+1;
v[1]=t%2;
t=t/2;
for(j=2;j<=n && t!=0 ;j++)
{t=v[j]+t;
v[j]=t%2;
t=t/2;
}
for(j=1;j<=n;j++)
if(v[j]==1)
fout<<j<<" ";
fout<<'\n';
}
return 0;
}