Pagini recente » Cod sursa (job #3319726) | Cod sursa (job #3320443) | Cod sursa (job #3301247) | Cod sursa (job #760205) | Cod sursa (job #3344644)
#include <bits/stdc++.h>
using namespace std;
int a[9], n;
bool visited[9
];
void bkt(int p) {
if (p == n + 1) {
for (int i = 1; i <= n; ++i)cout << a[i] << ' ';
cout << '\n';
return;
}
for (int i = 1; i <= n; ++i) {
if (!visited[i]) {
a[p] = i;
visited[i] = 1;
bkt(p + 1);
visited[i] = 0;
}
}
}
int main() {
freopen("permutari.in", "r", stdin);
freopen("permutari.out", "w", stdout);
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
bkt(1);
return 0;
}