advent-of-code/2020/Haskell/day01.hs

module Day01 where

import Data.List (tails)
import Data.Maybe (fromMaybe)


example :: [Integer]
example =
  [ 1721
  , 979
  , 366
  , 299
  , 675
  , 1456
  ]

scout :: Int -> [[a]] -> [[a]]
scout _ []    = []
scout 0 _     = []
scout 1 (h:_) = map (:[]) h
scout n (h:t) = map (head h:) (scout (n-1) t) <> scout n t


solve :: Int -> [Integer] -> Integer
solve n = product . head . filter ((2020==) . sum) . scout n . tails

solve1 :: [Integer] -> Integer
solve1 = solve 2

solve2 :: [Integer] -> Integer
solve2 = solve 3

main :: IO ()
main = do
  contents <- readFile "../.inputs/01.txt"
  let list = map read $ words contents
  print $ solve1 list
  print $ solve2 list