Pagini recente » Cod sursa (job #2576565) | Cod sursa (job #2734633) | Cod sursa (job #831829) | Cod sursa (job #411680) | Cod sursa (job #342927)
Cod sursa(job #342927)
#include <stdio.h>
long n, k, s[10];
void back(long k)
{
long i,j;
int ok=0;
if (k==n)
{
for (i=1; i<=n; ++i)
printf("%ld ",s[i]);
printf("\n");
}
else
{
for (i=1; i<=n; ++i);
{
ok=1;
for (j=1; j<=k; ++j)
if (s[j]==i)
{
ok=0;
break;
}
if (ok)
{
s[k+1]=i;
back(k+1);
}
}
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%ld",&n);
back(0);
return 0;
}