Question 3

CodeChefOpen on judge ↗

Phineas has 26 tasks. Each task is designated by a capital letter of the Latin alphabet. The teacher asked Phineas to solve tasks in the following way: if Phineas began to solve some task, then he must solve it to the end, without being distracted by another task. After switching to another task, Phineas cannot return to the previous task. Phineas can only solve one task during the day. Every da

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI