Pagini recente » Cod sursa (job #88638) | Cod sursa (job #2732305) | Cod sursa (job #1447878) | Cod sursa (job #231442) | Cod sursa (job #392721)
Cod sursa(job #392721)
#include<stdio.h>
int n,sol[10];
int continuare(int k)
{int i;
for(int i=1;i<k;i++)
if(sol[i]==sol[k])
return 0;
return 1;}
void afisare()
{int i;
for(i=1;i<=n;i++)
printf("%d ",sol[i]);
printf("\n");
}
void bkt(int k)
{int i;
for(i=1;i<=n;i++)
{sol[k]=i;
if(continuare(k))
{if(k==n)
afisare();
else bkt(k+1);}}
}
int main()
{freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
bkt(1);
fclose(stdin);
fclose(stdout);
return 0;
}