salva

#!/usr/bin/perl

use strict;
use warnings;

# my $tab = <<EOT;
# ------
# ------
# ------
# ------

salva

use strict;
use warnings;

my @a = ( [ 'b', 'c', 'f' ],
          [ 'a', 'd' ],
          [ 'c', 'd', 'e' ] );

my $last_ix = -1;
my %ixs;

salva

$ swipl

?- ["puzzle.prolog"].
true.

?- S = [_, 3, 17, 5, _, _, 13, _, 7], puzzle(S, O).
S = [41, 3, 17, 5, 23, 19, 13, 11, 7],
O = [61, 47, 31, 59, 37, 43, 71, 53, 541] ;
S = [11, 3, 17, 5, 41, 37, 13, 23, 7],
O = [31, 83, 43, 29, 67, 61, 59, 71, 601] ;

salva

#!/usr/bin/perl

use strict;
use warnings;

my $n = shift;
my $start = int($n / 2 + 1);
my @play = (($start..$n), (1..($start - 1)));

while ($n > 1) {

salva

#!/usr/bin/perl

use strict;
use warnings;

my $n = shift;

my @offsets;
my $offset = 2 - ($n & 1);
my $size = $n;

salva

#include <stdio.h>
#include <stdlib.h>

int main(int argc, char **argv) {
    int n = atoi(argv[1]);
    int half = n / 2;
    int i, j;
    int *a = malloc(n * sizeof(int));

    for (j = 0, i = half; i < n   ; i++, j++) a[j] = i;