shintakezou

#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

int main() {
  vector<string> vet {"hello", "world", "take", "the", "moon"};
  vector<string>::iterator it;

shintakezou

/*
See StackOverflow 
http://stackoverflow.com/questions/21137812/check-to-see-if-integer-is-one-in-which-each-digit-is-either-a-zero-or-a-one
to know why this exists. Do not take it seriously: the other answers show the way!
 */
#include <stdio.h>
#include <stdbool.h>
#include <inttypes.h>
#include <limits.h>

shintakezou

/*
 bison test 1 (single file),
 widely based on examples in the bison manual at
 http://www.gnu.org/software/bison/manual/

 It should compile with
 $ bison mcalcpp.yy
 $ g++ mcalcpp.tab.cc
 or alike. (bison v>3.0; any C++98 compiler should go)
*/

shintakezou

   incdir  "include:"
   include "exec/exec.i"
   include "exec/exec_lib.i"
   include "dos/dos_lib.i"

        opt p=68020


_start

shintakezou

	extern printf
	extern getchar
	extern isalpha



	section .data
	

shintakezou

package main

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

shintakezou

package main

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

type ControlFlow struct {

shintakezou

% 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),

shintakezou

{-
 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)

shintakezou

#include <stdio.h>

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

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