Cod sursa(job #1954258)
| Utilizator | Data | 5 aprilie 2017 12:06:26 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
# include <fstream>
using namespace std;
ifstream in("permutari.in");
ofstream out("permutari.out");
int n;
int v[9];
int verifica (int k)
{
for (int i = 1; i <= k - 1; i++)
if (v[i] == v[k])
return 0;
return 1;
}
void backtracking (int k)
{
if (k == n + 1)
{
for (int i = 1; i <= n; i++)
out << v[i] << ' ';
out << '\n';
return;
}
for (int i = 1; i <= n; i++)
{
v[k] = i;
if (verifica(k)) backtracking(k + 1);
}
}
int main()
{
in >> n;
backtracking(1);
return 0;
}
