Cod sursa(job #3244651)
| Utilizator | Data | 25 septembrie 2024 20:52:30 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream cin("permutari.in");
ofstream cout("permutari.out");
#define MAXN 9
int p[MAXN+1],frecv[MAXN+1];
int n;
void bkt(int k){
int i;
if(k==n+1){
for(i=1;i<=n;i++){
cout<<p[i]<<" ";
}
cout<<"\n";
}else{
for(i=1;i<=n;i++){
if(frecv[i]==0){
p[k]=i;
frecv[i]=1;
bkt(k+1);
frecv[i]=0;
}
}
}
}
int main(){
cin>>n;
bkt(1);
return 0;
}
