Cod sursa(job #1700760)
Utilizator | Data | 11 mai 2016 09:27:24 | |
---|---|---|---|
Problema | Generare de permutari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int n,fol[10],x[10],p;
void backk(int p)
{
if(p>n)
{
for(int i=1;i<=n;i++)
fout<<x[i]<<" ";
fout<<"\n";
return ;
}
for(int i=1;i<=n;i++)
if(fol[i]==0)
{
fol[i]=1;
x[p]=i;
backk(p+1);
fol[i]=0;
}
}
int main()
{
fin>>n;
backk(1);
return 0;
}