Cod sursa(job #943811)
Utilizator | Data | 26 aprilie 2013 15:38:47 | |
---|---|---|---|
Problema | Submultimi | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include<fstream>
#include<math.h>
using namespace std;
ifstream f("submultimi.in");
ofstream g("submultimi.out");
int i,j,n;
int main()
{ int n,a[20]={0},i,j,k=0,x,l,m,p=1,nr=0,b[100];
f>>n;
int y=pow(2,n);
for(i=1;i<y;i++)
{ b[i]=i;
x=i;
k = 0;
while(x!=0)
{
a[k++]=x%2;
x=x/2;
}
for(j=0;j<=k-1;j++)
if (a[j] == 1)
g << j + 1;
g << endl;
}
return 0;
}