Pagini recente » Cod sursa (job #3205160) | Cod sursa (job #2206194) | Arhiva Educationala | Cod sursa (job #2985189) | Cod sursa (job #410493)
Cod sursa(job #410493)
#include<stdio.h>
void afisare(int n, int v[10])
{
for(int i=1; i<=n; ++i)
printf("%d ",v[i]);
printf("\n");
}
void back(int k,int n,int v[10],int pus[10])
{
if(k==n+1) afisare(n,v);
else {
for(int i=1; i<=n; i++)
if(!pus[i])
{
v[k]=i;
pus[i]=1;
back(k+1,n,v,pus);
pus[i]=0;
}
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
int n,v[10],pus[10];
for(int i=1; i<=10; i++) pus[i]=0;
scanf("%d",&n);
back(1,n,v,pus);
return 0;
}