Cod sursa(job #2569631)
| Utilizator | Data | 4 martie 2020 12:56:18 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | r3capitusulare | Marime | 0.66 kb |
#include <fstream>
using namespace std;
int n, st[9];
ofstream fout("permutari.out");
bool valid(int p)
{
for (int i = 1; i < p; ++i)
if (st[i] == st[p])
return false;
return true;
}
void backtrack(int p)
{
for (int i = 1; i <= n; ++i)
{
st[p] = i;
if (valid(p))
{
if (p == n)
{
for (int j = 1; j <= n; ++j)
fout << st[j] << ' ';
fout << '\n';
}
else
backtrack(p + 1);
}
}
}
int main()
{
ifstream("permutari.in") >> n;
backtrack(1);
}
