AdventOfCode2024/Day2/puzzle1.hs
2024-12-14 11:49:14 +01:00

14 lines
513 B
Haskell

import Data.List (sort, sortBy)
import Data.Ord
isSafe :: [Int] -> Bool
isSafe xs = (isAscending xs || isDescending xs) && maximum distances <= 3 && minimum distances >= 1
where isAscending xs = xs == sort xs
isDescending xs = xs == sortBy (comparing Down) xs
distances = map abs $ zipWith (-) xs (drop 1 xs)
main = do
contents <- lines <$> readFile "day2.txt"
let reports = map read . words <$> contents
print . length $ filter isSafe reports