Pagini recente » Cod sursa (job #544222) | Diferente pentru happy-coding-2005-2/solutii intre reviziile 17 si 16 | pregatire_cls12_oji | Atasamentele paginii Rute maritime | Cod sursa (job #1555332)
#include<cstdio>
int n,st[9],vc[9];
void back(int k)
{if(k==n+1)
{int i;
for(i=1;i<=n;i++)
printf("%d ",st[i]);
printf("\n");
}
else
{int i;
for(i=1;i<=n;i++)
if(vc[i]==0)
{st[k]=i;
vc[i]=1;
back(k+1);
vc[i]=0;
}
}
}
int main ()
{freopen ("permutari.in","r",stdin);
freopen ("permutari.out","w",stdout);
scanf("%d",&n);
back(1);
return 0;
}