Finding Angie not Fanny

CodeChefOpen on judge ↗

Savio left from his school and is on his way to meet Angie. Angie shares her location $A$, $B$ to Savio. Savio who is at position $X,Y$ wants to reach to Angie and he can move only in the up right direction. Savio don't want to choose the path which passes through his house. Savio wants your help to know the total number of possible paths from his location to Angie's location after avoiding the pa

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