Cod sursa(job #3210589)
| Utilizator | Data | 6 martie 2024 19:57:18 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int n,j,sol[10];
bool used[10];
void afisare()
{
for(int i=1; i<=n;i++)
fout<<sol[i]<<' ';
fout<<'\n';
}
void back(int poz)
{
for(int i=1; i<=n; i++)
{
if(used[i]) continue;
sol[poz] = i;
used[i] = true;
//undo, return gen
if(poz ==n)
afisare();
else
back(poz+1);
used[i] = false;
}
}
int main()
{
fin>>n;
back(1);
return 0;
}
