Pagini recente » Cod sursa (job #1883474) | Cod sursa (job #1211896) | Cod sursa (job #343439) | Cod sursa (job #1392258) | Cod sursa (job #353817)
Cod sursa(job #353817)
#include<stdio.h>
int ut[20],st[20],n;
int valid(int k)
{
for(int i=1;i<k;i++)
if(st[i]==st[k])
return 0;
return 1;
}
void back(int k)
{
int p;
for(p=1;p<=n;p++)
{
st[k]=p;
if(valid(k))
{
if(k==n)
{
for(int i=1;i<=n;i++)
printf("%d ",st[i]);
printf("\n");
}
else
back(k+1);
}
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
back(1);
return 0;
}