tyamagu2

# http://nabetani.sakura.ne.jp/kanagawa.rb/evalex/

def evaluate(str)
  %w(| & + *).each_with_object(str.dup) { |op, e| while e.sub!(/\d+#{Regexp.escape(op)}\d+/) { |s| eval(s) }; end }
end

[
  [ 0, "4*5+6&7|8", "44" ],
  [ 1, "15*5", "75" ],
  [ 2, "15+5", "20" ],

tyamagu2

# 1. Find the sum of all the multiples of 3 or 5 below 1000.
1..999 |> Enum.filter(&(rem(&1, 3) == 0 || rem(&1, 5) == 0)) |> Enum.reduce(&+/2)

# 2. By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.
Stream.unfold({1, 2}, fn {n1, n2} -> {n1, {n2, n1 + n2}} end) |> Stream.filter(&(rem(&1, 2) == 0)) |> Enum.take_while(&(&1 < 4000_000)) |> Enum.reduce(&+/2)

tyamagu2

-- 1. Find the sum of all the multiples of 3 or 5 below 1000.
sum [ x | x <- [1..999], x `mod` 3 == 0 || x `mod` 5 == 0 ]

-- 2. By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.
let p2 = sum [ x | x <- takeWhile (< 4000000) fibs, even x] where fibs = 1 : 2 : zipWith (+) fibs (tail fibs)

tyamagu2

(define atom?
  (lambda (x)
    (and (not (pair? x)) (not (null? x)))))

(define add1 (lambda (n) (+ n 1)))

(define sub1 (lambda (n) (- n 1)))

(define first car)

tyamagu2

class Board
  def initialize(size = 8)
    @size = size
    @board = []
    @size.times do
      row = []
      @size.times { row << :none }
      @board << row
    end

tyamagu2

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

var N, M = 19, 5