Pagini recente » Cod sursa (job #1339227) | Cod sursa (job #2896693) | Cod sursa (job #2894108) | Cod sursa (job #3248989) | Cod sursa (job #399369)
Cod sursa(job #399369)
#include<iostream.h>
#include<conio.h>
#include<fstream.h>
int x[10],n;
ofstream g("permutari.out");
ifstream f("permutari.in");
void afisare()
{int i;
for(i=1;i<=n;i++)
g<<x[i]<<" ";
g<<"\n";
}
int valid(int k)
{int i;
for(i=1;i<k;i++)
if(x[i]==x[k]) return 0;
return 1;
}
void back(int k)
{int i;
for(i=1;i<=n;i++)
{x[k]=i;
if(valid(k)==1) if(k==n) afisare();
else back(k+1);
}
}
void main()
{
f>>n;
back(1);
}