Shriraj and Points

CodeChefOpen on judge ↗

Today, Vishal and Shriraj are playing a game in 2D Cartesian plane. Shriraj is at the location (sx, sy), while Vishal is at (vx,vy). In one move, Shriraj can: - Go to (sy, -sx). - Go to (sx + cx , sy + cy). Shriraj has to reach to Vishal's location to win the game. Shriraj is wondering if it is possible for him to win, if he plays optimally. As you are one of his students, he assigns the task

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