New Plans
CodeChefOpen on judge ↗
Professor is planning a new heist! He prepared a lot of different plans, and named them in alphabetical versions. Example alphabetical versions are, `A.A`, `R.X.C`, `Z`, etc. These versions can be ordered based on the general alphabetical order of the version, its sub-version and its sub-sub-version. For example, `[A, B, Z]`, `[A.A, A.X, X.A, Z.P]`, `[C.F.A, C.F.C, C.G.A]`, `[C, C.A, C.A.E, D]
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.
Sign in to chat with the tutor and save your progress.
Sign in to start