Cod sursa(job #1010634)
Utilizator | Data | 15 octombrie 2013 13:02:42 | |
---|---|---|---|
Problema | Generare de permutari | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.86 kb |
#include<iostream>
#include<fstream>
#include<cmath>
using namespace std;
ofstream g("permutari.out");
int st[9], n, gasit[10];
void afisez()
{
for(int i=1;i<=n;i++)
g<<st[i]<<" ";
}
int back(int p)
{
int i;
if(p==n+1)
{ afisez();
g<<endl;
}
else
for(i=1;i<=n;i++)
{
st[p]=i;
if(gasit[i]==0)
{
gasit[i]=1;
back(p+1);
gasit[i]=0;
}
}
}
int main()
{
ifstream f("permutari.in");
f>>n;
back(1);
f.close();
g.close();
return 0;
}