Cod sursa(job #3321563)
| Utilizator | Data | 10 noiembrie 2025 09:11:40 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
const int NMAX = 8;
int n, x[NMAX + 1];
bool fr[NMAX + 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++)
if (fr[i] == 0)
{
x[k] = i;
fr[i] = 1;
bt(k + 1);
fr[i] = 0;
}
}
else
afis();
}
int main()
{
f >> n;
bt(1);
f.close();
g.close();
return 0;
}
