Pagini recente » Cod sursa (job #363880) | Cod sursa (job #311945) | Cod sursa (job #2176455) | Cod sursa (job #2212907) | Cod sursa (job #269909)
Cod sursa(job #269909)
#include<iostream.h>
int n,sol[100];
ifstream in("permutari.in");
ofstream out("permutari.out");
void afisare()
{
int i;
for(i=1;i<=n;i++)
out<<sol[i]<<" ";
cout<<endl;
}
int verific(int k)
{
int i,j;
for(i=1;i<=k;i++)
for(j=i+1;j<=k;j++)
if(sol[i]==sol[j])
return 0;
return 1;
}
void back(int k)
{
int i;
if(k==n+1)
afisare();
else
{
for(i=1;i<=n;i++)
{
sol[k]=i;
if(verific(k)==1)
back(k+1);
}
}
}
int main()
{
in>>n;
in.close();
back(1);
out.close();
system("pause");
return 0;
}