Cod sursa(job #2174341)
| Utilizator | Data | 16 martie 2018 11:40:39 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("permutari.in");
ofstream out("permutari.out");
int n,k,s[20];
bool vizitat[100];
void afisare(){
for(int ii=1; ii<=n;++ii)
out<<s[ii]<<' ';
out<<'\n';
}
int Back ( int t, int n){
if(t-1==n) afisare();
else{
for(int i=1;i<=n;++i)
{
if(vizitat[i]==0){
s[t]=i;
vizitat[i]=1;
Back(t+1,n);
vizitat[i]=0;
}
}
}
}
int main()
{
in>>n;
Back(1,n);
return 0;
}
