Pagini recente » Borderou de evaluare (job #1551156) | Cod sursa (job #1407279) | Borderou de evaluare (job #676502) | Cod sursa (job #2092551) | Cod sursa (job #2393215)
#include <fstream>
#define MAX_N 8
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int v[MAX_N + 1], n;
bool u[MAX_N + 1];
void bk(int k) {
if (k <= n) {
for (int i = 1; i <= n; ++i) {
if (u[i]) {
u[i] = false;
v[k] = i;
bk(k + 1);
u[i] = true;
}
}
}
else {
for (int i = 1; i <= n; ++i) {
fout << v[i] << " ";
}
fout << "\n";
}
}
int main() {
fin >> n;
for (int i = 1; i <= n; ++i) {
u[i] = true;
}
bk(0);
}