Pagini recente » Autentificare | Cod sursa (job #584645) | Cod sursa (job #1810029) | Cod sursa (job #822425) | Cod sursa (job #694814)
Cod sursa(job #694814)
#include <cstdio>
#define NMAX 8
int n, sol[NMAX];
int check(int k)
{
for(int i=0;i<k;++i)
{
if(sol[k] == sol[i])
{
return 0;
}
}
return 1;
}
void back(int k)
{
if(k == n)
{
for(int i=0;i<n;++i)
{
printf("%d ", sol[i]);
}
printf("\n");
}
else
{
for(int i=1;i<=n;++i)
{
sol[k] = i;
if(check(k))
{
back(k+1);
}
}
}
}
int main()
{
freopen("permutari.in", "r", stdin);
freopen("permutari.out", "w", stdout);
scanf("%d", &n);
back(0);
return 0;
}