Pagini recente » Cod sursa (job #919628) | Cod sursa (job #2570261) | Cod sursa (job #761143) | Cod sursa (job #2531887) | Cod sursa (job #154578)
Cod sursa(job #154578)
#include <iostream.h>
#include <stdio.h>
int n, i, j, x[100], k;
int ok (int k)
{
for (i=1;i<=n-1;i++)
if (x[k]==x[i])
return 0;
return 1;
}
int permutari (int n)
{
for (i=1;i<=n;i++)
{
x[k]=i;
if (ok(k))
if (k==n)
for (j=1;j<=n;j++)
cout>>x[j];
else back(k+1);
}
}
int main ()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
cin>>n;
permutari(1);
return 0;
}