Cod sursa(job #3355033)
| Utilizator | Data | 21 mai 2026 16:53:04 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
#define NMAX 9
int n;
int v[NMAX], f[NMAX];
ifstream fin("permutari.in");
ofstream fout("permutari.out");
void perm(int pos) {
if (pos == n) {
for (int i = 0; i < n - 1; ++i)
fout << v[i] << ' ';
fout << v[n-1] << '\n';
return;
}
for (int i = 1; i <= n; ++i) {
if (f[i] == 0) {
v[pos] = i;
f[i] = 1;
perm(pos + 1);
f[i] = 0;
}
}
return;
}
int main() {
fin>>n;
perm(0);
return 0;
}
