📌 📄 内容摘要:
macosterminal (@folow20601) 在 让你们的模型来挑战吧！ 中发帖
**Problem 5:**
Turbo the snail plays a game on a board with 2024 rows and 2023 columns. There are hidden monsters in 2022 of the cells. Initially, Turbo does not know where any of the monsters are, but he knows that there is exactly one monster in each row except the first row and the last row, and that each column contains at most one monster.
Turbo makes a series of attempts to go from the first...
────────── 链接信息 ──────────
🔗 论坛链接: linux.do
📎 访问地址: https://linux.do/t/topic/332832/1
─────────────────────────────
📢 来源：LINUX DO
