Cod sursa(job #2934258)
| Utilizator | Data | 5 noiembrie 2022 18:36:51 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream cin("permutari.in");
ofstream cout("permutari.out");
int n, i, j, x[10], f[10];
void backtrack(int pas) {
if (pas==n+1) {
for (int i=1;i<=n;i++)
cout<<x[i]<<" ";
cout<<"\n";
}
else
for (int i=1;i<=n;i++)
if (f[i]==0) {
x[pas]=i;
f[i]=1;
backtrack(pas+1);
f[i]=0;
}
}
int main() {
cin>>n;
backtrack(1);
}
