Pagini recente » Cod sursa (job #1845537) | Cod sursa (job #995663) | Cod sursa (job #1987975) | Cod sursa (job #1933319) | Cod sursa (job #943794)
Cod sursa(job #943794)
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
int a[50];
bool c[1000];
int main()
{int k,i,j=1,z=1,n,ci,m;
ifstream f("submultimi.in");
ofstream g("submultimi.out");
f>>n;
for(i=1;i<=n;i++)
a[i]=i;
m=pow(2,n);
for(i=1;i<=m-1;i++)
{ci=i;
while(ci!=0)
{
k=ci%2;
c[z]=k;
ci=ci/2;
z++;}
for(j=1;j<=z;j++)
if(c[j]==1)g<<a[j];
g<<endl;
z=1;
}
}