Pagini recente » Cod sursa (job #2678088) | Cod sursa (job #1198747) | Cod sursa (job #1522642) | Cod sursa (job #1755080) | Cod sursa (job #1007142)
#include <iostream>
#include <fstream>
using namespace std;
#define MAXN 10
ifstream f("permutari.in");
ofstream g("permutari.out");
int a[MAXN], n;
void print()
{
for (int i = 1; i <= n; i++) {
g << a[i] << ' ';
}
g << endl;
}
bool check(int el, int n) {
for (int i = 1; i <= n; i++) {
if (a[i] == el) {
return false;
}
}
return true;
}
void back(int i = 1)
{
for (int j = 1; j <= n; j++) {
a[i] = j;
if (check(j, i - 1) == false) {
continue;
}
if (i < n) {
back(i + 1);
} else {
print();
}
}
}
int main()
{
f >> n;
back();
return 0;
}