Pagini recente » Cod sursa (job #1980546) | Cod sursa (job #2629780) | Cod sursa (job #1620556) | Cod sursa (job #226338) | Cod sursa (job #2605851)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int x[9], n;
void afis()
{
for(int i = 1; i <= n; ++ i)
g << x[i] << " ";
g << "\n";
}
bool valid(int k)
{
for(int i = 1; i < k; ++ i)
if(x[i] == x[k])
return false;
return true;
}
void back(int k)
{
for(int i = 1; i <= n; ++ i)
{
x[k] = i;
if(valid(k))
if(k == n)
afis();
else
back(k + 1);
}
}
int main()
{
f >> n;
back(1);
return 0;
}