Cod sursa(job #1843051)
| Utilizator | Data | 8 ianuarie 2017 00:26:27 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include<fstream>
using namespace std;
ifstream cin("permutari.in");
ofstream cout("permutari.out");
int n, v[9];
void show(){
for(int i=1; i<=n; ++i){
cout<<v[i]<<" ";
}
cout<<"\n";
}
int solutie(int w){ return w==n;}
int valid(int w){
for(int i=1; i<w; ++i)if(v[i]==v[w]) return 0;
return 1;
}
void permutari(int w){
for(int i=1; i<=n; ++i){
v[w]=i;
if(valid(w)){
if(solutie(w)) show();
else permutari(w+1);
}
}
}
int main(){
cin>>n;
permutari(1);
return 0;
}
