Pagini recente » Cod sursa (job #2047897) | Cod sursa (job #1544564) | Cod sursa (job #8640) | Cod sursa (job #2645543) | Cod sursa (job #3204331)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int n,x[8];
void Afis(){
for(int j=1; j<=n; j++){
fout<<x[j]<<" ";
}
fout<<endl;
}
bool Ok(int k){
for(int i=1; i<k; ++i){
if(x[k]==x[i]){
return false;
}
}
return true;
}
bool Solutie(int k){
return k==n;
}
void back(int k){
for (int i = 1; i <= n; ++i) {
x[k] = i;
if (Ok(k)) {
if (Solutie(k)) {
Afis();
} else {
back(k + 1);
}
}
}
}
int main()
{
fin>>n;
back(1);
return 0;
}