Pagini recente » Cod sursa (job #3129078) | Cod sursa (job #286980) | Cod sursa (job #189261) | Cod sursa (job #1329855) | Cod sursa (job #3355484)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("submultimi.in");
ofstream fout("submultimi.out");
void printSolution(vector<int> solution) {
for (int i = 0; i < (int)solution.size(); i++) {
fout << solution[i] << " ";
}
fout << "\n";
}
void backtracking(int start, int stop, vector<int>& domain, vector<int>& solution) {
if (start == stop) {
printSolution(solution);
return;
}
int i;
if (start > 0) {
i = solution.back();
} else {
i = 0;
}
for (; i < (int)domain.size(); i++) {
solution.push_back(domain[i]);
backtracking(start + 1, stop, domain, solution);
solution.pop_back();
}
}
int main() {
int n;
fin >> n;
vector<int> domain(n);
vector<int> solution(n);
for (int i = 1; i <= n; i++) {
domain[i-1] = i;
}
for (int i = 1; i <= n; i++) {
backtracking(0, i, domain, solution);
}
fin.close();
fout.close();
return 0;
}