Pagini recente » Borderou de evaluare (job #1385425) | Cod sursa (job #405020)
Cod sursa(job #405020)
#include<stdio.h>
int n,p,sol[10];
void afisare()
{
for(int i=1;i<=n;++i)
printf("%d ",sol[i]);
printf("\n");
}
inline bool valid(int p)
{
for(int i=1;i<p;++i)
if(sol[p]==sol[i])
return false;
return true;
}
void bkt(int p)
{
if(p==n+1)
{
afisare();
return;
}
for(int i=1;i<=n;++i)
{
sol[p]=i;
if(valid(p))
bkt(p+1);
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
bkt(1);
return 0;
}