Cod sursa(job #3313400)
| Utilizator | Data | 4 octombrie 2025 08:13:25 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
using namespace std;
int x[10],n;
void Afis()
{
for(int j=1;j<=n;j++)
cout<<x[j]<<" ";
cout<<endl;
}
bool Ok(int k)
{
for(int i=1;i<k;++i)
if(x[k]==x[i])
return false;
return true;
}
bool Sol(int k)
{
return k==n;
}
void backt(int k)
{
for(int i=1;i<=n;++i)
{
x[k]=i;
if(Ok(k))
if(Sol(k))
Afis();
else
backt(k+1);
}
}
int main()
{cin>>n;
backt(1);
return 0;
}
