Cod sursa(job #2442386)
Utilizator | Ciobotea Ioana Ioana_Ciobotea | Data | 23 iulie 2019 19:35:19 |
---|---|---|---|
Problema | Generare de permutari | Scor | 80 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int n, x[101];
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 << endl;
}
void backt(int k)
{
if(k <= n) ///mai avem elemente
for(int i = 1; i <= n; i++)
{
x[k] = i;
if(valid(k))
backt(k + 1);
}
else
afis();
}
int main()
{
f >> n;
backt(1);
return 0;
}