Pagini recente » Cod sursa (job #401530) | Cod sursa (job #2614563) | Borderou de evaluare (job #2611775) | Borderou de evaluare (job #2372873) | Cod sursa (job #617017)
Cod sursa(job #617017)
#include<stdio.h>
using namespace std;
short unsigned x[9],n;
void afisare()
{
for(int i=1;i<=n;i++)
printf("%d ", x[i]);
printf("\n");
}
int valid(int p)
{
for(int i=1;i<p;i++)
if(x[i]==x[p])return 0;
return 1;
}
void bkt(int p)
{
for(int i=1;i<=n;i++)
{
x[p]=i;
if(valid(p))
if(p==n)afisare();
else bkt(p+1);
}
}
int main ()
{
freopen("1", "r", stdin);
freopen("2", "w", stdout);
scanf("%d", &n);
bkt(1);
return 0;
}