Pagini recente » Cod sursa (job #1089247) | Istoria paginii runda/wellcodesimulareav-9martie/clasament | Cod sursa (job #3253923) | Cod sursa (job #1177759) | Cod sursa (job #2260937)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("submultimi.in");
ofstream out("submultimi.out");
int n;
bool a[20];
void bacK(int k)
{
for(int i=0;i<=1;i++)
{
a[k]=i;
if(k==n)
{
for(int j=1;j<=k;j++)
{
if(a[j]==1)
out<<j<<' ';
}
out<<'\n';
}
else
bacK(k+1);
}
}
int main()
{
in>>n;
bacK(1);
return 0;
}