Cod sursa(job #2870870)
| Utilizator | Data | 12 martie 2022 17:14:10 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int n,st[10];
bool viz[10];
void afis(int vf)
{
for(int i=1;i<=vf;i++)
fout<<st[i]<<' ';
fout<<'\n';
}
void back(int vf)
{
for(int x=1;x<=n;x++)
{
st[vf]=x;
if(viz[st[vf]]==0)///nu e vizitat
{
viz[st[vf]]=1;
if(vf==n)
afis(vf);
else
back(vf+1);
viz[st[vf]]=0;
}
}
}
int main()
{
fin>>n;
back(1);
return 0;
}
