Cod sursa(job #2263811)
Utilizator | Data | 19 octombrie 2018 12:32:55 | |
---|---|---|---|
Problema | Generare de permutari | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<bits/stdc++.h>
using namespace std;
int n, a[100], v[100];
ifstream fin("paranteze.in");
ofstream fout("paranteze.out");
void backt(int lvl)
{
if(lvl>n){
for(int i=1;i<=n;i++)
fout<<a[i]<<" ";
fout<<"\n";
return;
}
else{
for(int i=1;i<=n;i++)
if(!v[i])
{
a[lvl]=i;
v[i]=1;
backt(lvl+1);
v[i]=0;
}
}
}
int main()
{
fin>>n;
backt(1);
return 0;
}