Cod sursa(job #2262814)
Utilizator | Data | 17 octombrie 2018 20:34:19 | |
---|---|---|---|
Problema | Generare de permutari | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <bitset>
using namespace std;
int st[9],n;
bitset <9> d;
void afisare()
{
for(int i=1;i<=n;i++)
cout<<st[i]<<" ";
cout<<endl;
}
void back(int k)
{
for(int i=1;i<=n;i++)
if(d[i]==0)
{
d[i]=1;
st[k]=i;
if(k==n) afisare();
else back(k+1);
d[i]=0;
}
}
int main()
{
cin>>n;
back(1);
return 0;
}