Pagini recente » Cod sursa (job #2050448) | Cod sursa (job #2471468) | Cod sursa (job #2860135) | Cod sursa (job #1362491) | Cod sursa (job #2771146)
#include <fstream>
using namespace std;
ifstream in("permutari.in");
ofstream out("permutari.out");
int n, perm[9];
bool ok(int k){
for(int i = 1; i < k; i++)
if(perm[i] == perm[k]) return false;
return true;
}
void bck(int k){
if(k == n + 1) {
for(int i = 1; i < k; i++)
out << perm[i] << ' ';
out << '\n';
}else{
for(int i = 1; i <= n; i++) {
perm[k] = i;
if(ok(k))
bck(k + 1);
}
}
}
int main() {
in >> n;
bck(1);
return 0;
}