Cod sursa(job #2960398)
Utilizator | Data | 4 ianuarie 2023 11:53:50 | |
---|---|---|---|
Problema | Generare de permutari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.76 kb |
#include <fstream>
using namespace std;
ifstream cin ("permutari.in");
ofstream cout ("permutari.out");
int n , v[30];
bool SolutieValida(int pas)
{
for(int i = 1 ; i < pas ; ++i)
if(v[pas] == v[i])
return false;
return true;
}
void Back(int pas)
{
for(int i = 1 ; i <= n ; ++i)
{
v[pas] = i;
if(SolutieValida(pas) && pas <= n)
{
if(pas == n)
{
for(int i = 1 ; i <= n ; ++i)
cout << v[i] <<' ';
cout << '\n';
}
else if(pas < n)
Back(pas+1);
}
}
}
int main()
{
cin >> n;
Back(1);
}