Cod sursa(job #2842295)
Utilizator | Data | 31 ianuarie 2022 15:28:42 | |
---|---|---|---|
Problema | Generare de permutari | Scor | 80 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
const int NMAX = 8;
int n;
int v[NMAX], f[NMAX];
void bkt(int poz) {
if(poz == n) {
for(int i = 0; i < n; i++)
fout << v[i] << ' ';
fout << endl;
} else {
for(int i = 1; i <= n; i++) {
if(f[i] == 0) {
v[poz] = i;
f[i] = 1;
bkt(poz + 1);
f[i] = 0;
}
}
}
}
int main() {
fin >> n;
bkt(0);
fin.close();
fout.close();
return 0;
}