Pagini recente » Cod sursa (job #1722385) | Cod sursa (job #2389983) | Cod sursa (job #1157924) | Cod sursa (job #2847552) | Cod sursa (job #166403)
Cod sursa(job #166403)
#include <stdio.h>
int n;
int x[10], s[10];
void Back(int k);
void Write();
int main()
{
freopen("permutari.in", "r", stdin);
freopen("permutari.out", "w", stdout);
scanf("%d", &n);
Back(1);
return 0;
}
void Back(int k)
{
for ( int i = 1; i <= n; i++ )
{
x[k] = i;
if ( !s[i] )
{
s[i] = 1;
if ( k == n ) Write();
else Back(k+1);
s[i] = 0;
}
}
}
void Write()
{
for ( int i = 1; i < n; i++ )
printf("%d ", x[i]);
printf("%d\n", x[n]);
}