Cod sursa(job #2458354)
Utilizator | Data | 20 septembrie 2019 11:55:10 | |
---|---|---|---|
Problema | Generare de permutari | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
using namespace std;
int n, fr[100], x[1000];
void afis(){
for(int i=1;i<=n;i++){
cout<<x[i]<<" ";
}
cout<<endl;
}
void bacK(int k){
if(n==k-1){
afis();
return;
}else{
for(int i=1;i<=n;i++){
if(!fr[i]){
fr[i]=1;
x[k]=i;
bacK(k+1);
fr[i]=0;
}
}
}
}
int main()
{
cin>>n;
bacK(1);
}