Pagini recente » Cod sursa (job #1915070) | Cod sursa (job #1226579) | Cod sursa (job #71241) | Cod sursa (job #2523743) | Cod sursa (job #263368)
Cod sursa(job #263368)
#include<stdio.h>
#define N 9
int n,sol[N];
viud afisare()
{
for(int i=1;i<=n;++i)
printf("%d ",sol[i]);
printf("\n");
}
char valid(int k)
{
for(int i=1;i<k;++i)
if(sol[i]==sol[k])
return 0;
return 1;
}
void back(int k)
{
if(k==n+1)
{
afisare();
return;
}
for(int i=1;i<=n;++i)
{
sol[k]=i;
if(valid(k))
back(k+1);
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
return 0;
}