Skip to content

Instantly share code, notes, and snippets.

@bsl
bsl / gist:657358
Created November 1, 2010 00:08
.Xdefaults subdued terminal colors
URxvt*background: black
URxvt*foreground: gray
URxvt*color0: #000000
URxvt*color1: #9e1828
URxvt*color2: #aece92
URxvt*color3: #968a38
URxvt*color4: #414171
URxvt*color5: #963c59
URxvt*color6: #418179
@bsl
bsl / pe3.hs
Created October 21, 2010 21:24
project euler 3
-- http://projecteuler.net/index.php?section=problems&id=3
--
-- The prime factors of 13195 are 5, 7, 13 and 29.
--
-- What is the largest prime factor of the number 600851475143?
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
main :: IO ()
main =
@bsl
bsl / pe1.hs
Created October 20, 2010 14:01
project euler #1
-- http://projecteuler.net/index.php?section=problems&id=1
--
-- If we list all the natural numbers below 10 that are multiples of 3 or 5, we
-- get 3, 5, 6 and 9. The sum of these multiples is 23.
--
-- Find the sum of all the multiples of 3 or 5 below 1000.
main :: IO ()
main = print answer
@bsl
bsl / pe2.hs
Created October 20, 2010 01:57
project euler #2
-- http://projecteuler.net/index.php?section=problems&id=2
--
-- Each new term in the Fibonacci sequence is generated by adding the previous
-- two terms. By starting with 1 and 2, the first 10 terms will be:
--
-- 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...
--
-- Find the sum of all the even-valued terms in the sequence which do not
-- exceed four million.