sphynx

module Q where

data Quarter = NE | NW | SE | SW deriving Show
type Vector = (Float, Float)

quarter :: Vector -> Vector -> Quarter
quarter look target = detect $ angle look - angle target

detect :: Float -> Quarter
detect x

sphynx

import Control.Monad
import System.Random
import Data.List

size :: Int
size = 3

steps :: Int
steps = 10000

sphynx

import Data.Ratio

main :: IO ()
main = print $ result 5

result :: Integer -> Rational
result size = abs $ sum
  [ fromIntegral mult * infTailSum size d
  | (mult, d) <- coeffs size
  ]

sphynx

module Main where

import Data.Array
import Data.List
import Data.Ord
import Text.Printf

type Coord = (Int, Int)
type Size = (Int, Int)

sphynx

module Main where

import Data.List

monkeys = [{-2416, -} 2117, 2085, 2018, 2013, 2010, 2006, 1929, 1749, 1746, 1678, 1622, 1622, 1586, 1543, 1497, 1487, 1445]

bishops = [2064, 2052, 2031, 1965, 1935, 1930, 1904, 1808, 1772, 1760, 1732, 1730, 1715, 1676, 1656, 1599, 1550, 1523, 1410]

diff :: Num a => [a] -> [a] -> [a]
diff = zipWith (-)

sphynx

// send first ball from (0, 0) to (200, 0)
animate(firstBall, 0, 200)();

// send second ball from (0, 0) to (100, 0) but with the tempo like it was sent to (200, 0)
animateWithTweak(secondBall, 0, 100, 200)();

function animate(ball, start, intended) {
  return function () {
      ball.animate({cx: intended}, 2000, ">");
  }

sphynx

// send first ball from (0, 0) to (200, 0)
animate(firstBall, 0, 200)();

// send second ball from (0, 0) to (100, 0) but with the tempo like it was sent to (200, 0)
animateWithTweak(secondBall, 0, 100, 200)();

function animate(ball, start, intended) {
  return function () {
      ball.animate({cx: intended}, 2000, ">");
  }

sphynx

module Main where

d = [3, 4, 9, 14, 15, 19, 28, 37, 47, 50, 54, 56, 59, 61, 70, 73, 78, 81, 92, 95, 97, 99]

superset [] = [[]]
superset (x:xs) = ss ++ map (x:) ss
                  where ss = superset xs

check [] = False
check xs = m == sum xs - m where m = maximum xs

sphynx

primes :: [Integer]
primes = sieve [2..]
  where
    sieve (p:xs) = p : sieve [x | x <- xs, x `mod` p > 0]

main = print $ primes !! 10000

-- compile with `ghc --make primes.hs`, then run run run :)

sphynx

module Main where

import Data.List (maximumBy)
import Data.Word (Word64)
import Data.Array.IO (IOUArray, newArray, readArray, writeArray, unsafeFreeze)
import Data.Array.Unboxed (UArray)
import Data.Array.IArray (assocs)
import Control.Monad (forM_)

type Cache = IOUArray Word64 Word64