Pagini recente » Cod sursa (job #2159856) | Cod sursa (job #694095) | Cod sursa (job #2932398) | Cod sursa (job #1633438) | Cod sursa (job #2427938)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
const int CMAX = 20;
int n , k , v[CMAX];
void citire()
{
fin >> n;
}
void afisare()
{
for(int i=1;i<=n;i++)
fout << v[i] << " ";
fout << '\n';
}
bool verificare(int q)
{
for(int i=1;i<=q-1;i++)
{
if(v[i]==v[q])
return false;
}
return true;
}
void bkt(int q)
{
for(int i=1;i<=n;i++)
{
v[q] = i;
if(verificare(q)==true)
{
if(q==n)
afisare();
else
bkt(q+1);
}
}
}
int main()
{
citire();
bkt(1);
return 0;
}