Pagini recente » Cod sursa (job #547594) | Cod sursa (job #2784725) | Istoria paginii runda/ojiji-becali | Cod sursa (job #2195798) | Cod sursa (job #2430160)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int v[100], N;
void solutie()
{
for (int i = 1; i <= N; i++)
g << v[i] << " ";
g << '\n';
}
bool cond(int k)
{
for (int i = 1; i < k; ++i)
if (v[k] == v[i])
return false;
return true;
}
void bt(int k)
{
for (int i = 1; i <= N; ++i)
{
v[k] = i;
if (cond(k))
if (k == N)
solutie();
else
bt(k + 1);
}
}
int main()
{
f >> N;
f.close();
bt(1);
g.close();
return 0;
}