Cod sursa(job #2932154)
Utilizator | David Curca divaddd | Data | 1 noiembrie 2022 23:25:05 |
---|---|---|---|
Problema | Generare de permutari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
#define MAX 10
using namespace std;
int n,st[MAX],vf[MAX];
ifstream fin("permutari.in");
ofstream fout("permutari.out");
void backtrack(int pas){
if(pas == n+1){
for(int i = 1; i <= n; i++){
fout << st[i] << " ";
}
fout << "\n";
}else{
for(int i = 1; i <= n; i++){
if(vf[i] == 0){
vf[i] = 1;
st[pas] = i;
backtrack(pas+1);
vf[i] = 0;
}
}
}
}
int main()
{
fin >> n;
backtrack(1);
return 0;
}