Pagini recente » Cod sursa (job #3295000) | algoritmiada-2019/runda-preoji/clasament | Rating infoarena | Cod sursa (job #3292062) | Cod sursa (job #3294959)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
vector<int> v;
void afisare(int n) {
for (int i = 1; i <= n; i++)
fout << v[i] <<" ";
fout << endl;
}
bool sol(int k, int n) {
return k == n;
}
bool ok(int k) {
for (int i = 1; i < k; i ++)
if (v[i] == v[k])
return false;
return true;
}
void bkt (int k, int n) {
for (int i = 1 ; i <= n; i++) {
v.at(k) = i;
if (ok(k)) {
if (sol(k, n))
afisare(n);
else bkt(k + 1, n);
}
}
}
int main() {
int n;
fin >> n;
v.resize(n + 1);
bkt(1, n);
return 0;
}