Cod sursa(job #2788412)
Utilizator | Data | 25 octombrie 2021 17:28:19 | |
---|---|---|---|
Problema | Generare de permutari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
const int NMAX = 8;
ifstream in ("permutari.in");
ofstream out ("permutari.out");
int n;
int solCrt[1 + NMAX];
bool luat[1 + NMAX];
void back(int pozCrt)
{
if(pozCrt == n + 1)
{
for (int i = 1; i <= n; i++)
{
out << solCrt[i] << ' ';
}
out << '\n';
}
else
{
for (int i = 1; i <= n; i++)
{
if (!luat[i])
{
luat[i] = true;
solCrt[pozCrt] = i;
back(pozCrt + 1);
luat[i] = false;
}
}
}
}
int main()
{
in >> n;
back(1);
return 0;
}