Snake Charmer — ORAC

In 2025, this problem was updated to use a simpler way of handling input and output, called standard input and output. You can read more about this change by clicking here.

Time Limit	Memory Limit
1 second	256 MiB

Log in to submit!

If the statement isn't loading correctly, you can open it in a new tab.

Problem info

- Subtask 1 (20 points) has 10 cases.
- Subtask 2 (10 points) has 6 cases.
- Subtask 3 (10 points) has 8 cases.
- Subtask 4 (15 points) has 13 cases.
- Subtask 5 (10 points) has 18 cases.
- Subtask 6 (35 points) has 47 cases.
This problem has a checker