Pagini recente » Cod sursa (job #501379) | Cod sursa (job #1240357) | Cod sursa (job #2763151) | Cod sursa (job #1400002) | Cod sursa (job #2665505)
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int n, x[10];
void afisare()
{
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 backt(int k)
{
for(int i = 1; i <= n; i++)
{
x[k] = i;
if(valid(k))
{
if(k == n) afisare();
else backt(k + 1);
}
}
}
int main()
{
f >> n;
backt(1);
return 0;
}