Cod sursa(job #2911402)
Utilizator | Data | 29 iunie 2022 10:31:51 | |
---|---|---|---|
Problema | Generare de permutari | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
const int NMAX=9;
int viz[NMAX];
int v[NMAX];
int n;
void backt(int k)
{
int i;
if(k==n+1)
{
for(i=1;i<=n;i++)
cout<<v[i]<<" ";
cout<<"\n";
}
else
{
for(i=1;i<=n;i++)
if(viz[i]==0)
{
v[k]=i;
viz[i]=1;
backt(k+1);
viz[i]=0;
}
}
}
int main()
{
int i;
cin>>n;
backt(1);
return 0;
}