Easy closed form for this recurrence relation. Of course, jgr steals my thunder.

Code: Select all

main = print . sum . take 20 . map tetra . iterate ((+ 9) . (* 10)) $ 9
  where tetra n = (n * (n + 1) * (n + 2)) `div` 6


this is hilarious! your code sucks.

import System.IO import System.Random data Temp = Exact | Hot | Warm | Cold deriving (Show, Eq) temp :: Int -> Temp temp dist | dist == 0 = Exact | dist <= 2 = Hot | dist <= 4 = Warm | otherwise = Cold guess :: Int -> Int -> IO () guess 0 ans = putStrLn $ &quo...

import qualified Data.Bimap as B import Control.Monad main = forever $ getLine >>= putStrLn . map mutate where dict = B.fromList $ zip "abcdefghijklmnoqrstuvwxy" "ɐߩЀƒ&#I¿K£M?øQЯ§†µ^W×¥" mutate c = maybe c id $ B.lookup c dict `mplus` B.lookup...

my suggestion is to ungline me from irc

don't be fags

thanks

i lol'd

grow a pair and wait until you can play with the big boys

760,840 + (1/8 * 760,840) > 55,945