Pagini recente » Cod sursa (job #52201) | Cod sursa (job #2631966) | Cod sursa (job #2533401) | Cod sursa (job #2556471) | Cod sursa (job #404535)
Cod sursa(job #404535)
#include<stdio.h>
int n,sol[10];
bool marcat[9];
void afisare()
{
int i;
for(i=1;i<=n;i++)
printf("%d ",sol[i]);
printf("\n");
}
int valid(int p)
{
int i;
for(i=1;i<=p-1;i++)
if(sol[i]==sol[p]) return 0;
return 1;
}
void bkt(int p)
{
int i;
if(p==n+1)
{
afisare();
return ;
}
for(i=1;i<=n;i++)
{
if(marcat[i])
continue;
sol[p]=i;
marcat[i]=true;
bkt(p+1);
marcat[i]=false;
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
bkt(1);
return 0;
}