Cod sursa(job #873467)
Utilizator | Data | 7 februarie 2013 11:49:15 | |
---|---|---|---|
Problema | Generare de permutari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include<fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
short n,i,k,m,p,a[10];
bool viz[10];
int corect(int k)
{
if(k>1)
if(a[k]<=a[k-1]) return 0;
else return 1;
}
void afisare(int k)
{
short i;
for(i=1;i<=k;i++)
g<<a[i]<<" ";
g<<'\n';
}
void back(int k)
{
int i;
if(k==n+1)
afisare(k-1);
for(i=1;i<=n;i++)
{
if(!viz[i])
{
a[k]=i;
viz[i]=1;
back(k+1);
viz[i]=0;
}
}
}
int main()
{
f>>n;
back(1);
}