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