Mai intai trebuie sa te autentifici.
Cod sursa(job #2917218)
Utilizator | Data | 3 august 2022 20:32:48 | |
---|---|---|---|
Problema | Generare de permutari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.67 kb |
#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast")
using namespace std;
ifstream fin ("permutari.in");
ofstream fout ("permutari.out");
const int MAX_N = 10;
int n, output[MAX_N], freq[MAX_N];
void bt(int step){
if(step > n){
for(int i=1; i<=n; i++)
fout<<output[i]<<" ";
fout<<"\n";
return;
}
for(int i=1; i<=n; i++)
if(freq[i] == 0){
freq[i] = 1;
output[step] = i;
bt(step+1);
freq[i] = 0;
}
}
int main (){
ios_base::sync_with_stdio(false);
fin.tie(nullptr), fout.tie(nullptr);
fin>>n;
bt(1);
return 0;
}