Pagini recente » Atasamentele paginii Clasament 1234123 | Istoria paginii runda/splunge6 | Istoria paginii runda/road-to-sepi-1. | Cod sursa (job #1683560) | Cod sursa (job #2008318)
#include<fstream>
#include<iostream>
using namespace std;
ifstream fin ("submultimi.in");
ofstream fout ("submultimi.out");
int n, st[17];
void Afisare()
{
int i;
int ok=0;
for (i=1; i<=n && ok==0; i++)
if (st[i]==1)
ok=1;
if (ok==1)
{
for (i=1; i<=n; i++)
{
if (st[i]!=0)
fout << i << " ";
}
fout << "\n";
}
}
void Back(int top)
{
int i;
if (top == n+1) Afisare();
else
for (i=0; i<2; i++)
{
st[++top] = i;
Back(top+1);
}
}
int main ()
{
fin >> n;
Back(1);
return 0;
}