Cod sursa(job #2379987)
| Utilizator | Data | 14 martie 2019 12:28:38 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
ifstream fin("permutari.in");
ofstream fout("permutari.out");
using namespace std;
bool used[110];
int perm[110];int n;int i;
void back(int lvl)
{
if(lvl>n)
{for(i=1;i<=n;i++)
fout<<perm[i]<<" ";
fout<<endl;
return;}
for(int i=1;i<=n;i++){
if(!used[i]){
perm[lvl]=i;
used[i]=1;
back(lvl+1);
used[i]=0;
}}
}
int main()
{int lvl;
fin>>n;
for(int j=1;j<=n;j++)
fin>>perm[j];
back(1);
}
