Cod sursa(job #2026937)
Utilizator | Data | 25 septembrie 2017 13:00:14 | |
---|---|---|---|
Problema | Generare de permutari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
using namespace std;
int n,per[50],f[50];
void afisare()
{
int i;
for(int i=1;i<=n;i=i+1){
cout<<per[i]<<" ";
}
cout<<"\n";
}
void bec(int pas)
{
if(pas>n){
afisare();
}
else{
for(int i=1;i<=n;i=i+1){
if(!f[i]){
per[pas]=i;
f[i]=1;
bec(pas+1);
f[i]=0;
}
}
}
}
int main()
{
int p;
cin>>n;
bec(1);
return 0;
}