Pagini recente » Cod sursa (job #2280240) | Cod sursa (job #2615805) | Cod sursa (job #2103218) | Clasament igorj_9 | Cod sursa (job #2961337)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
const int MAX_SIZE = 8;
int n, v[MAX_SIZE + 1];
bool check(int element) {
for (int i = 1; i < element; ++i) {
if (v[element] == v[i]) {
return false;
}
}
return true;
}
bool check_for_display(int element) {
return element == n;
}
void display() {
for (int i = 1; i <= n; ++i) {
cout << v[i] << ' ';
}
cout << '\n';
}
void generate(int element) {
for (int i = 1; i <= n; ++i) {
v[element] = i;
if (check(element) != false && check_for_display(element) == true) {
display();
} else if (check(element) != false && check_for_display(element) != true) {
generate(element + 1);
}
}
}
int main() {
cin >> n;
generate(1);
return 0;
}