Circular Cakewalk

CodeChefOpen on judge ↗

A circular cake of radius r is placed with center at (x,y) on an infinite 2-D grid. Shubhv is standing at (x0, y0) and can move at v units/second. She can move in any direction and want to get out of the cake as soon as possible. What is the minimum time in which she can reach a point outside or on the boundary of the cake? Input - The first line of the input contains an integer T denoting the n

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