Pagini recente » Cod sursa (job #2086782) | Cod sursa (job #2283563) | Cod sursa (job #1420347) | Cod sursa (job #3183251) | Cod sursa (job #1413279)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("submultimi.in");
ofstream fout("submultimi.out");
int n;
bool good[30];
int v[30];
void show(int k){
for(int i = 1; i <= k; i++){
fout << v[i] << " ";
}
fout << "\n";
}
void beck(int k){
if(k > n){
return;
}
for(int i = v[k - 1] + 1; i <= n; i++){
if(good[i] == false){
good[i] = true;
v[k] = i;
show(k);
beck(k + 1);
good[i] = false;
}
}
}
int main()
{
fin >> n;
beck(1);
return 0;
}