Pagini recente » Cod sursa (job #2282977) | Cod sursa (job #565032) | Cod sursa (job #625161) | Cod sursa (job #878283) | Cod sursa (job #653211)
Cod sursa(job #653211)
# include <stdio.h>
int n,k,sol[10];
void afis()
{
int i;
for (i=1; i<=n; i++)
printf("%d ",sol[i]);
printf("\n");
}
bool ok(int k)
{
int i;
for (i=1; i<k; i++)
if (sol[i]==sol[k]) return false;
return true;
}
void back(int k)
{
int i;
if (k>n) afis();
else
{
for (i=1; i<=n; i++)
{
sol[k]=i;
if (ok(k)) back(k+1);
}
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d\n",&n);
back(1);
}