import gleam/io
import gleam/int
import gleam/list
import ext/resultx as resx
import util/input_util

fn solve(numbers: List(Int), n n: Int) -> Int {
  numbers
  |> list.combinations(by: n)
  |> list.find(one_that: fn(p) { int.sum(p) == 2020 })
  |> resx.assert_unwrap
  |> int.product
}

fn part1(numbers: List(Int)) -> Int {
  solve(numbers, n: 2)
}

fn part2(numbers: List(Int)) -> Int {
  solve(numbers, n: 3)
}

pub fn main() -> Nil {
  let testing = input_util.read_numbers("test01")
  let assert 514_579 = part1(testing)
  let assert 241_861_950 = part2(testing)

  let input = input_util.read_numbers("day01")
  io.debug(part1(input))
  io.debug(part2(input))

  Nil
}