Cod sursa(job #784185)
| Utilizator | Data | 5 septembrie 2012 00:38:48 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
short v[10], n, i, j;
bool apare[10] { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
void tipar() {
for(int i=1; i<=n; i++) g<<v[i]<<" ";
g<<"\n";
}
int back(int k) {
if(k==n+1) { tipar(); return 0; }
for(int i=1; i<=n; i++) {
if(!apare[i]) {
apare[i] = true;
v[k]=i;
back(k+1);
apare[i] = false;
}
}
}
int main() {
f>>n;
back(1);
f.close();
g.close();
return 0;
}
