Pagini recente » Cod sursa (job #1964743) | Cod sursa (job #1411248) | Cod sursa (job #1934840) | Cod sursa (job #721687) | Cod sursa (job #144670)
Cod sursa(job #144670)
#include <stdio.h>
long int n;
long int st[10],is[10];
void back(long int nivel)
{
long int i;
if (nivel==n+1)
{
for (i=1;i<=n;i++) printf("%ld ",st[i]);
printf("\n");
return;
}
for (i=1;i<=n;i++)
if (!is[i])
{
st[nivel]=i;
is[i]=1;
back(nivel+1);
is[i]=0;
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%ld",&n);
back(1);
return 0;
}