Pagini recente » Cod sursa (job #2718148) | Cod sursa (job #1165867) | Cod sursa (job #1562259) | Cod sursa (job #844644) | Cod sursa (job #2157085)
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int n, x[9];
bool valid(int k)
{
for(int i = 1; i < k; i++)
if(x[k] == x[i]) return 0;
return 1;
}
void prelsol()
{
for(int i = 1; i <= n; i++)
g << x[i] << ' ';
g << endl;
}
void bt(int k)
{
if(k <= n)
for(int i = 1; i <= n; i++)
{
x[k] = i;
if(valid(k) == 1)
bt(k + 1);
}
else
prelsol();
}
int main()
{
f >> n;
bt(1);
return 0;
}