Submission #17940471

---

Source Code Expand

defmodule Main do
  def main do
    a = IO.read(:line) |> String.trim() |> String.to_integer()
    b = IO.read(:line) |> String.trim() |> String.to_integer()
    c = IO.read(:line) |> String.trim() |> String.to_integer()
    d = IO.read(:line) |> String.trim() |> String.to_integer()
    e = IO.read(:line) |> String.trim() |> String.to_integer()

    solve(a, b, c, d, e)
    |> IO.puts()
  end

  @doc ~S"""
  https://atcoder.jp/contests/abc123/tasks/abc123_b

  ## Examples

      iex> Abc123B.solve(29, 20, 7, 35, 120)
      215
      iex> Abc123B.solve(123, 123, 123, 123, 123)
      643

  """
  def solve(a, b, c, d, e) do
    list = [a, b, c, d, e]

    last_order = last_order(list)

    List.delete(list, last_order)
    |> Enum.map(&ceil_tens_point/1)
    |> Enum.sum()
    |> Kernel.+(last_order)
  end

  defp last_order(list) do
    list
    |> Enum.map(&{rem(&1, 10), &1})
    |> Enum.reject(fn {ones_place, _} -> ones_place == 0 end)
    |> Enum.min_by(fn {ones_place, _} -> ones_place end, fn -> {nil, 0} end)
    |> elem(1)
  end

  defp ceil_tens_point(n) when rem(n, 10) == 0, do: n

  defp ceil_tens_point(n), do: n + 10 - rem(n, 10)
end

Submission Info

Judge Result