Pagini recente » Cod sursa (job #1647410) | Cod sursa (job #1833253) | Cod sursa (job #2662217) | Cod sursa (job #3174715) | Cod sursa (job #3144616)
#include <iostream>
#include <fstream>
#include <bitset>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
const int MAX_LENGTH = 8;
bitset<MAX_LENGTH + 1> freq;
void genPermutation(int maxNum, int length, int v[]) {
if (length == maxNum + 1) {
for (int i = 1; i <= maxNum; ++i) {
fout << v[i] << ' ';
}
fout << '\n';
return;
}
for (int i = 1; i <= maxNum; ++i) {
if (freq[i] == 0) {
v[length] = i;
freq[i] = 1;
genPermutation(maxNum, length + 1, v);
freq[i] = 0;
}
}
}
int main() {
int n, permutation[MAX_LENGTH + 1];
fin >> n;
genPermutation(n, 1, permutation);
return 0;
}