Pagini recente » Borderou de evaluare (job #189436) | Istoria paginii utilizator/lotto44 | Rezultatele filtrării | Cod sursa (job #1909741)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int j,n,x,i; int a[18];
ifstream f("submultimi.in"); ofstream g("submultimi.out");
x=1;
f>>n;
for(i=1;i<=n;i++) {x=x*2;}
x=x-1;
for(i=1;i<=n;i++) a[i]=0;
for(i=1;i<=x;i++)
{
a[1]=a[1]+1;
j=1;
while (a[j]==2) {a[j]=0; j++; a[j]=a[j]+1;}
for(j=1;j<=n;j++) {if (a[j]==1){g<<j<<' ';}}
g<<'\n';
}
return 0;
}