Cod sursa(job #1478683)
| Utilizator | Data | 29 august 2015 12:01:11 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
# include <fstream>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int n,v[10];
int cont(int k){
for(int i=1;i<k;i++){
if(v[i]==v[k])
return 0;
}
return 1;
}
void back(int k){
if(k==n+1){
for(int i=1;i<=n;i++){
fout<<v[i]<<" ";
}
fout<<"\n";
}
else{
for(int i=1;i<=n;i++){
v[k]=i;
if(cont(k))
back(k+1);
}
}
}
int main () {
fin>>n;
back(1);
return 0;
}
