Bear and Ladder
Bearland has infinitely many cities, numbered starting from 1. Some pairs of cities are connected with bidirectional roads: - There are roads 1-2, 3-4, 5-6, 7-8, and so on (there is a road between cities 2*i+1 and 2*i+2 for every non-negative integer i). - There are roads 1-3, 3-5, 5-7, 7-9, ... (between every two consecutive odd numbers). - There are roads 2-4, 4-6, 6-8, 8-10, ... (between eve
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