Cod sursa(job #1913077)
Utilizator | Gemene Adrian adiXM | Data | 8 martie 2017 11:43:15 |
---|---|---|---|
Problema | Generare de permutari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
const int nMax = 12;
int St[nMax], n;
bool viz[nMax];
inline void Back(int top) {
if(top == n + 1) {
for(int i = 1; i <= n; i++) {
g << St[i] << " ";
}
g << "\n";
}
else {
for(int i = 1; i <= n; i++) {
if(!viz[i]) {
St[top] = i;
viz[i] = 1;
Back(top + 1);
viz[i] = 0;
}
}
}
}
int main()
{
f >> n;
Back(1);
return 0;
}