Pagini recente » Cod sursa (job #313070) | Cod sursa (job #742836) | Statistici rares tamasanu (rqres) | Cod sursa (job #1269216) | Cod sursa (job #2884595)
#include <iostream>
#include <cstdio>
using namespace std;
FILE *fin=fopen("permutari.in", "r");
FILE *fout=fopen("permutari.out", "w");
int v[10];
int n;
bool Ok(int p)
{
for (int i=1; i<=p; i++) {
if (i==p) continue;
if (v[i]==v[p]) return false;
}
return true;
}
bool Solutie (int k)
{
if (k==n) return true;
return false;
}
void Afisare()
{
for (int i=1; i<=n; i++) {
fprintf(fout, "%d%c", v[i], ' ');
}
fprintf(fout, "%c", '\n');
}
void backtracking (int k)
{
for (int i=1; i<=n; i++) {
v[k]=i;
if (Ok(k)==true) {
if (Solutie(k)==true)
Afisare();
else backtracking(k+1);
}
}
}
int main()
{
fscanf(fin, "%d", &n);
backtracking(1);
return 0;
}