License | MIT |
---|---|
Maintainer | @tylerjl |
Safe Haskell | Safe-Inferred |
Language | Haskell2010 |
Solutions to the day 20 set of problems for adventofcode.com.
Original credit for most of this due to aepsilon: https://www.reddit.com/r/adventofcode/comments/3xjpp2/day_20_solutions/cy5brqe
Synopsis
- withMinPresents :: Int -> Int
- withMinPresents2 :: Int -> Int
Documentation
Finds lowest house number that receives as many as the given presents
Finds lowest house number that receives as many as the given presents |given the special delivery case.