Pagini recente » Cod sursa (job #2497126) | Cod sursa (job #1203867) | Cod sursa (job #2043221) | Cod sursa (job #2477216) | Cod sursa (job #2483502)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("permutari.in");
ofstream fout ("permutari.out");
int sol[9], n;
void afis ()
{
for (int i = 1; i <= n; ++ i)
fout << sol[i] << " ";
fout << "\n";
}
bool solutie (int k)
{
return k == n + 1;
}
bool valid (int k)
{
for (int i = 1; i <= k - 1; ++ i)
if (sol[i] == sol[k])
return false;
return true;
}
bool succesor (int k)
{
if (sol[k] < n)
{
sol[k] ++;
return true;
}
return false;
}
void bkt (int k)
{
if (solutie(k))
afis();
else
{
sol[k] = 0;
while (succesor(k))
if (valid(k))
bkt(k + 1);
}
}
int main()
{
fin >> n;
bkt(1);
return 0;
}