Pagini recente » Cod sursa (job #2516958) | Cod sursa (job #1675171) | Cod sursa (job #2404654) | Cod sursa (job #563001) | Cod sursa (job #1676830)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("submultimi.in");
ofstream g("submultimi.out");
bool sol[20];
void printSol(int n) {
int count = 0;
for (int i = 0; i < n; i++) if (sol[i]) count++;
if (count != 0) {
for (int i = 0; i < n; i++) {
if (sol[i]) g << i+1 << " ";
}
g << endl;
}
}
void back(int n, int k) {
if (k == n) {
printSol(n);
return;
}
sol[k] = false;
back(n, k+1);
sol[k] = true;
back(n, k+1);
}
int main()
{
int n;
f >> n;
back(n, 0);
f.close();
g.close();
return 0;
}