Pagini recente » Cod sursa (job #1638143) | Cod sursa (job #251465) | Cod sursa (job #1112208) | Cod sursa (job #2531135) | Cod sursa (job #2666507)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int n, sol[21];
void read(){
fin>>n;
}
bool verif(int len){
for(int i = 1; i < len; i++)
if(sol[i] == sol[len])
return false;
return true;
}
bool solution(int len){
return len == n;
}
void print(int len){
for(int i = 1; i <= len; ++i)
fout<<sol[i]<<" ";
fout<<'\n';
}
void bkt(int len){
for(int i = 1; i <= n; ++i){
sol[len] = i;
if(verif(len)){
if(solution(len))
print(len);
else
bkt(len+1);
}
}
}
int main(){
read();
bkt(1);
}