Pagini recente » Cod sursa (job #1319035) | Cod sursa (job #2417359) | Cod sursa (job #1253938) | Cod sursa (job #258167) | Cod sursa (job #1008723)
#include <iostream>
#include <fstream>
#define kNMAX 10
int stiva[kNMAX];
int k, N;
bool vizitat[kNMAX];
std::fstream in, out;
void solutie(){
for(int i = 1; i <= N; i++){
out << stiva[i] << " ";
}
out << "\n";
return;
}
void back(int k){
if (k == N) solutie();
else{
for(int i = 1; i <= N; i++){
if(!vizitat[i]){
vizitat[i] = true;
stiva[k + 1] = i;
back(k + 1) ;
vizitat[i] = false;
}
}
}
}
int main(){
in.open("permutari.in", std::ios::in);
out.open("permutari.out", std::ios::out);
in >> N;
back(0);
in.close();
out.close();
return 0;
}