Pagini recente » Cod sursa (job #1512891) | Cod sursa (job #343217) | Cod sursa (job #2884856) | Cod sursa (job #886082) | Cod sursa (job #1679987)
#include <stdio.h>
void BKT(int sol[], int poz, int n)
{
bool ok; int i, j;
if ( sol[1] == n )
return ;
for ( i = sol[poz]+1; i <= n; i++ )
{
ok = true;
for ( j = 1; j <= poz; j++ )
if ( sol[j] == i )
{
ok = false;
break;
}
if(ok)
{
sol[poz+1] = i;
for ( j = 1; j <= poz + 1; j++ )
printf("%d ", sol[j]);
printf("\n");
BKT(sol, poz+1, n);
}
}
}
int main()
{
int n, sol[17], i;
freopen("submultimi.in","r",stdin);
freopen("submultimi.out","w",stdout);
scanf("%d", &n);
for ( i = 0; i <= n; i++ )
sol[i] = 0;
BKT(sol, 0, n);
return 0;
}