Cod sursa(job #2690702)
| Utilizator | Data | 25 decembrie 2020 13:13:06 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
#define Nmax 20
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int n,st[Nmax];
void afisare()
{ int i;
for(i=1;i<=n;++i)
fout<<st[i]<<" ";
fout<<'\n';
}
bool OK(int k)
{ int i;
for(i=1;i<k;++i)
if(st[i]==st[k])return 0;
return 1;
}
void back(int k)
{ int i;
for(i=1;i<=n;++i)
{
st[k]=i;
if(OK(k))
{
if(k==n)afisare();
else back(k+1);
}
}
}
int main()
{
fin>>n;
back(1);
return 0;
}
