Pagini recente » Cod sursa (job #729927) | Cod sursa (job #722780) | Cod sursa (job #2019292) | Cod sursa (job #2785800) | Cod sursa (job #2019118)
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int sol[10], n;
bool valid(int k)
{
for(int i = 1; i < k; ++i)
if(sol[i] == sol[k]) return false;
return true;
}
bool solutie(int k)
{
if(n == k) return true;
return false;
}
void afis()
{
for(int i = 1; i <= n; ++i) g << sol[i] << " ";
g << '\n';
}
void bkt(int k)
{
if(k == n + 1) return;
else
{
for(int i = 1; i <= n; ++i)
{
sol[k] = i;
if(valid(k))
{
if(solutie(k)) afis();
else bkt(k + 1);
}
}
}
}
int main()
{
f >> n;
bkt(1);
return 0;
}