Pagini recente » Cod sursa (job #1752788) | Cod sursa (job #2475650) | Cod sursa (job #100645) | Cod sursa (job #3261841) | Cod sursa (job #666781)
Cod sursa(job #666781)
#include <fstream>
#include <iostream>
using namespace std;
int N, M;
int X[20];
ifstream fin("submultimi.in");
ofstream fout("submultimi.out");
int cont(int k) {
int i;
for (i=1;i<k;i++)
if (X[i] == X[k])
return 0;
return 1;
}
void back(int k) {
if (k>N) {
int ok = 1;
for (int j = 1; j<=N;j++)
if (X[j] == 1) {
fout<<j<<" ";
ok = 0;
}
if (ok == 0)
fout<<"\n";
return;
}
int i;
for (i=0;i<=1;i++) {
X[k] = i;
back(k+1);
}
}
int main() {
fin>>N;
back(1);
return 0;
}