Pagini recente » Borderou de evaluare (job #1013094) | Borderou de evaluare (job #212511) | Borderou de evaluare (job #2076493) | Borderou de evaluare (job #1821978) | Cod sursa (job #743720)
Cod sursa(job #743720)
#include<stdio.h>
short int n,sol[9],v[9];
void back(int k)
{
if(k>n)
{
for(register int i=1;i<=n;++i)
printf("%d ",sol[i]);
printf("\n");
}
else
for(register int i=1;i<=n;++i)
{
sol[k]=i;
if(v[sol[k]]==0)
{
v[sol[k]]=1;
back(k+1);
v[sol[k]]=0;
}
}
}
int main ()
{
scanf("%d",&n);
back(1);
return 0;
}