Pagini recente » Cod sursa (job #2190264) | Cod sursa (job #1386120) | Cod sursa (job #1113668) | Cod sursa (job #2549680) | Cod sursa (job #3244609)
#include <iostream>
#include <algorithm>
using namespace std;
int n, v[9];
int fact(int nrf) {
int factorial = 1;
for (int i = 1; i <= nrf; i++) {
factorial *= i;
}
return factorial;
}
int main() {
cin >> n;
for(int i = 1; i <= n; i++) {
v[i] = i;
}
int nr = fact(n);
for(int i = 1; i <= nr; i++) {
for(int i = 1; i <= n; i++) {
cout << v[i] << ' ';
}
next_permutation(v + 1, v + n + 1);
cout << '\n';
}
}