Copyright | (c) Eric Mertens 2021 |
---|---|
License | ISC |
Maintainer | emertens@gmail.com |
Safe Haskell | None |
Language | Haskell2010 |
https://adventofcode.com/2021/day/5
The input is a bunch of segments; count intersections.
Documentation
solve :: [(Int, Int, Int, Int)] -> Int Source #
Compute the number of points covered by more than one segment