Pagini recente » Cod sursa (job #3191857) | Cod sursa (job #2116591) | Cod sursa (job #15) | Cod sursa (job #2871012) | Cod sursa (job #1337227)
#include <iostream>
#include <fstream>
using namespace std;
int el[9], k,n;
ifstream f("permutari.in");
ofstream g("permutari.out");
void afis()
{
for (int i = 1; i <= n; i++) g << el[i] << " ";
g << "\n";
}
int valid(int k)
{
int i;
for (i = 1; i < k; i++) if (el[i] == el[k]) return 0;
return 1;
}
void bkt(int k)
{
for (int i = 1; i <= n; i++)
{
el[k] = i;
if (valid(k))
{
if (k == n) afis();
else bkt(k + 1);
}
}
}
int main()
{
f >> n;
bkt(1);
f.close();
g.close();
return 0;
}