Cod sursa(job #914988)
| Utilizator | Data | 14 martie 2013 17:13:44 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include<fstream>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int n, p[10];
bool uz[10];
void afisare(){
for(int i=1; i<=n; ++i)
fout << p[i] << " ";
fout << "\n";
}
void perm(int k){
int i;
if(k-1 == n)
afisare();
else{
for(i=1; i<=n; ++i)
if(!uz[i]){
p[k] = i;
uz[i] = 1;
perm(k+1);
uz[i] = 0;
}
}
}
int main(){
fin >> n;
perm(1);
fin.close();
fout.close();
return 0;
}
