Pagini recente » Borderou de evaluare (job #2603525) | Borderou de evaluare (job #2538375) | Borderou de evaluare (job #2948921) | Borderou de evaluare (job #120502) | Cod sursa (job #319225)
Cod sursa(job #319225)
#include<stdio.h>
int v[10],n,a[10];
void back(int k)
{
if(k==n+1)
{
for(int i=1;i<=n;++i)
printf("%d ",a[i]);
printf("\n");
}
else
for(int i=1;i<=n;++i)
{
if(v[i]==0)
{
v[i]=1;
a[k]=i;
back(k+1);
v[i]=0;
}
}
}
int main()
{freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
back(1);
}