Mauro Panigada shintakezou

## susi927bis.py
#! /usr/bin/python
#
# see https://gist.github.com/shintakezou/666a96e63b0c01be2f78#file-susi927-py
# The problem is the same, but here we use logilab.constraint
# https://www.logilab.org/project/logilab-constraint
# and of course we take into account the fact that prices are integer
# positive numbers.
#
from logilab.constraint import *

## susi927.py
#! /usr/bin/python3
#
# italian magazine "La Settimana Enigmistica",
# quiz "Quesito con la Susi" n. 927
#
# R, B, S: prices of one bottle of red, white and sparkling wine
# a, b, c: number of sparkling (a), white (b) and red (c) wine in a
#          box of seven bottles
#
# R = 3B

## dudeney_miller.cpp
/*
    this code solves one of the Dudeney's Canterbury Puzzles,
    namely The Miller's Puzzle.

    My input was an italian blog, i.e.
    http://rudimatematici-lescienze.blogautore.espresso.repubblica.it/2015/06/07/lenigma-del-mugnaio/

    But you can find all the puzzles (thus even the miller's puzzle)
    here:

## generic.f90
program generic_example
  use my_sum_module

  implicit none

  print *, my_sum(1.0, 3.0)   ! 1 + 1.5
  print *, my_sum(1, 5)       ! 1 + 2
  print *, my_sum(2, 3.0)     ! 2 + 1.5
  print *, my_sum(1.5, 7)     ! 1.5 + 3.5

## generic.c
#include <stdio.h>

typedef struct {
    double x;
    double y;
} vec2d;

#define sum(X, Y) _Generic((X),                      \
                           int: sum2l((X), (Y)),     \
                           long: sum2l((X), (Y)),    \

## susi923.hs
{-
 This code answers to "Un quesito con la Susi n. 923"
 (a puzzle on an italian magazine).
 Brute force, no optimization (and no Haskell guru here).
-}
import Data.List

checkSol :: [Int] -> Bool
checkSol a =
  5*susi == gianni && (sum a) == (susi + gianni + tavolo)

## quesito_susi.prolog
% gprolog: nth
% swi prolog: nth0
vicino(List, A, B) :-
    nth(IndexA, List, A),
    nth(IndexB, List, B),
    abs(IndexA - IndexB) =:= 1.

chi(Luca, Aldo, Berto) :-
    vicino([4, 0, 2, 1, 3], Luca, Aldo),
    vicino([1, 2, 3, 0, 4], Berto, Aldo),

## gist:88188591a1a856def7c4
package main

import (
	io "bufio"
	"fmt"
	"os"
	"unicode"
)

type ControlFlow struct {

## gist:9f8aa5d6acb9d0e75247
package main

import (
	io "bufio"
	"fmt"
	"os"
	"sync"
	"unicode"
)

## coroutine-x86.asm


	extern printf
	extern getchar
	extern isalpha


	section .data
	#! /usr/bin/python
	#
	# see https://gist.github.com/shintakezou/666a96e63b0c01be2f78#file-susi927-py
	# The problem is the same, but here we use logilab.constraint
	# https://www.logilab.org/project/logilab-constraint
	# and of course we take into account the fact that prices are integer
	# positive numbers.
	#
	from logilab.constraint import *
	#! /usr/bin/python3
	#
	# italian magazine "La Settimana Enigmistica",
	# quiz "Quesito con la Susi" n. 927
	#
	# R, B, S: prices of one bottle of red, white and sparkling wine
	# a, b, c: number of sparkling (a), white (b) and red (c) wine in a
	# box of seven bottles
	#
	# R = 3B
	/*
	this code solves one of the Dudeney's Canterbury Puzzles,
	namely The Miller's Puzzle.

	My input was an italian blog, i.e.
	http://rudimatematici-lescienze.blogautore.espresso.repubblica.it/2015/06/07/lenigma-del-mugnaio/

	But you can find all the puzzles (thus even the miller's puzzle)
	here:
	program generic_example
	use my_sum_module

	implicit none

	print *, my_sum(1.0, 3.0) ! 1 + 1.5
	print *, my_sum(1, 5) ! 1 + 2
	print *, my_sum(2, 3.0) ! 2 + 1.5
	print *, my_sum(1.5, 7) ! 1.5 + 3.5
	#include <stdio.h>

	typedef struct {
	double x;
	double y;
	} vec2d;

	#define sum(X, Y) _Generic((X), \
	int: sum2l((X), (Y)), \
	long: sum2l((X), (Y)), \
	{-
	This code answers to "Un quesito con la Susi n. 923"
	(a puzzle on an italian magazine).
	Brute force, no optimization (and no Haskell guru here).
	-}
	import Data.List

	checkSol :: [Int] -> Bool
	checkSol a =
	5*susi == gianni && (sum a) == (susi + gianni + tavolo)
	% gprolog: nth
	% swi prolog: nth0
	vicino(List, A, B) :-
	nth(IndexA, List, A),
	nth(IndexB, List, B),
	abs(IndexA - IndexB) =:= 1.

	chi(Luca, Aldo, Berto) :-
	vicino([4, 0, 2, 1, 3], Luca, Aldo),
	vicino([1, 2, 3, 0, 4], Berto, Aldo),
	package main

	import (
	io "bufio"
	"fmt"
	"os"
	"unicode"
	)

	type ControlFlow struct {