Pagini recente » Cod sursa (job #672392) | Cod sursa (job #1030732) | Cod sursa (job #1647544) | Cod sursa (job #1563364) | Cod sursa (job #798412)
Cod sursa(job #798412)
#include<fstream>
using namespace std;
int n,k,x[101];
ifstream f("submultimi.in");
ofstream g("submultimi.out");
void prelsol()
{ int ok=1; int ok1=1;
for(int i=1;i<=n;i++)
{if(x[i] == 1) g<<i<<" ";
if(x[i] == 1) ok=0;
else ok1=0;
}
if(ok==0 && ok1==0) g<<'\n';
}
void back()
{ k=1; x[k]=-1;
do { while( x[k] < 1 )
{ x[k]++;
if(k == n) prelsol();
else {k++; x[k]=-1;}
}
k-=1;
} while(k>0);
}
int main()
{ f>>n;
back();
g.close();
return 0;
}