oshmkufa2010

## myself.md

      
              1 file
            
          
              0 forks
            
          
                0 comments
              
            
              0 stars
            
          
                oshmkufa2010
                / myself.md
            
            
              Last active
              October 12, 2020 02:41
            
          
## odd-plus-even-equals-odd-prove-it.hs
{-# LANGUAGE GADTs, DataKinds,
             TypeFamilies, UndecidableInstances #-}

module OddsAndEvens where

-- | The natural numbers.
data Nat = Z | S Nat

-- | The axioms of even numbers.
data Even (a :: Nat) :: * where

## genesis_public_key
04c258f70b834445ce3ba8854e71dccdae356383ee13dad47631a7f2917997b2eba2189498dfbea9cd047e14a680e2e73ced2bc2630fcefc54421f1b93b67d03db

## edit_distance.rb
def edit_distance(a, b)
  return b.size if a.size == 0
  return a.size if b.size == 0
  init = {}
  init[0] = (0...b.size).map{|j| [j, b[0, j+1].include?(a[0]) ? j : j + 1]}.to_h
  (1...a.size).each do |i|
    init[i] = {0 => a[0, i+1].include?(b[0]) ? i : i + 1}
  end

  (1...a.size).to_a.product((1...b.size).to_a).reduce(init) do |acc, (i, j)|

## sicp4-42.rb
def solve
  constriants = {
    betty: (1..5),
    kitty: (1..5),
    mary: (1..5),
    ethel: (1..5),
    joan: (1..5),
  }
  names = constriants.keys
  products = names.map {|name| constriants[name].to_a }.reduce(&:product).map(&:flatten)

## pyramid.rb
def longest_slide_down(pyramid)
  pyramid.reverse.reduce([0]*(pyramid.size + 1)) {|result, x|(0...result.size-1).reduce([]) {|acc, i| acc + [[result[i], result[i+1]].max + x[i]]}}[0]
end
	{-# LANGUAGE GADTs, DataKinds,
	TypeFamilies, UndecidableInstances #-}

	module OddsAndEvens where

	-- \| The natural numbers.
	data Nat = Z \| S Nat

	-- \| The axioms of even numbers.
	data Even (a :: Nat) :: * where
	def edit_distance(a, b)
	return b.size if a.size == 0
	return a.size if b.size == 0
	init = {}
	init[0] = (0...b.size).map{\|j\| [j, b[0, j+1].include?(a[0]) ? j : j + 1]}.to_h
	(1...a.size).each do \|i\|
	init[i] = {0 => a[0, i+1].include?(b[0]) ? i : i + 1}
	end

	(1...a.size).to_a.product((1...b.size).to_a).reduce(init) do \|acc, (i, j)\|
	def solve
	constriants = {
	betty: (1..5),
	kitty: (1..5),
	mary: (1..5),
	ethel: (1..5),
	joan: (1..5),
	}
	names = constriants.keys
	products = names.map {\|name\| constriants[name].to_a }.reduce(&:product).map(&:flatten)
	def longest_slide_down(pyramid)
	pyramid.reverse.reduce([0]*(pyramid.size + 1)) {\|result, x\|(0...result.size-1).reduce([]) {\|acc, i\| acc + [[result[i], result[i+1]].max + x[i]]}}[0]
	end