Cod sursa(job #3307256)
| Utilizator | Data | 19 august 2025 13:15:27 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n, x[101];
ifstream f("permutari.in");
ofstream g("permutari.out");
bool valid(int k)
{
for(int i = 1; i < k; i++)
if(x[k] == x[i])
return 0;
return 1;
}
void afis()
{
for(int i = 1; i <= n; i++)
g << x[i] << ' ';
g << '\n';
}
void bt(int k)
{
if(k <= n)
{
for(int i = 1; i <= n; i++)
{
x[k] = i;
if(valid(k))
bt(k + 1);
}
}
else afis();
}
int main()
{
f >> n;
bt(1);
f.close();
g.close();
return 0;
}
