Cod sursa(job #1652984)
| Utilizator | Data | 15 martie 2016 17:24:47 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int n;
int st[10];
int f[10];
void back(int lung) {
if (lung == n) {
for (int i = 1; i <= n; ++i)
fout << st[i] << " ";
fout << "\n";
} else {
for (int i = 1; i <= n; ++i)
if (f[i] == 0) {
f[i] = 1;
st[lung + 1] = i;
back(lung + 1);
f[i] = 0;
}
}
}
int main() {
fin >> n;
back(0);
return 0;
}
