Cod sursa(job #1810235)
| Utilizator | Data | 19 noiembrie 2016 19:35:52 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <bits/stdc++.h>
#define nmax 9
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int st[nmax],top,n,gasire[nmax];
///O(n!)
void Afisare()
{
int i;
for(i=1;i<=n;i++)
fout<<st[i]<<" ";
fout<<"\n";
}
void Back(int top)
{
if(top==n+1)
Afisare();
else
{
for(int i=1;i<=n;i++)
if(!gasire[i])
{
gasire[i]=1;
st[top]=i;
Back(top+1);
gasire[i]=0;
}
}
}
int main()
{
fin>>n;
Back(1);
fin.close();
fout.close();
return 0;
}
