← All problemsSign in

Diagonal movement

CodeChefRating 1157Open on judge ↗

Given the coordinates $(x, y)$ of a point in 2-D plane. Find if it is possible to reach $(x, y)$ from $(0, 0)$. The only possible moves from any coordinate $(i, j)$ are as follows: - Go to the point with coordinates $(i + 1, j + 1)$. - Go to the point with coordinates $(i + 1, j - 1)$ - Go to the point with coordinates $(i - 1, j + 1)$. - Go to the point with coordinates $(i - 1, j - 1)$. ###

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

Sign in to chat with the tutor and save your progress.

Sign in to start