Pagini recente » Istoria paginii runda/wellcodesimulareoni1/clasament | Cod sursa (job #985642) | Cod sursa (job #2787397) | Cod sursa (job #1880986) | Cod sursa (job #2077763)
#include <iostream>
#include <fstream>
#define NMAX 20
using namespace std;
ifstream fin("submultimi.in");
ofstream fout("submultimi.out");
int n, folosit[NMAX], sol[NMAX];
void printSol(int limit) {
bool intrat = 0;
for (int i = 0; i < limit; i++) {
fout<<sol[i]<<" ";
intrat = 1;
}
if (intrat)
fout<<"\n";
}
void back(int pos) {
printSol(pos);
for (int i = 1; i <= n; i++) {
if (!folosit[i] && sol[pos-1] < i) {
folosit[i] = 1;
sol[pos] = i;
back(pos + 1);
folosit[i] = 0;
}
}
}
int main()
{
fin >> n;
back(0);
fin.close();
fout.close();
return 0;
}