Pagini recente » Cod sursa (job #67646) | Cod sursa (job #1714299) | Cod sursa (job #2348701) | Cod sursa (job #1165796) | Cod sursa (job #1491700)
#include<stdio.h>
using namespace std;
int x[10], uz[15], n;
void afis()
{
int i;
for(i = 1; i <= n; i++)
printf("%d ", x[i]);
printf("\n");
}
void backtr(int k)
{
int i;
if(k > n)
afis();
else
{
for(i = 1; i <= n; i++)
if(uz[i] != 1)
{
x[k] = i;
uz[i] = 1;
backtr(k + 1);
uz[i] = 0;
}
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d", &n);
backtr(1);
fclose(stdin);
fclose(stdout);
return 0;
}