Obsessed Jennifer

CodeChefOpen on judge ↗

## Problem Statement Jennifer is obsessed with numbers, patterns and operators. There are `N` poles (`P1`, `P2`, `P3`, ..., `PN`) on the road from her home to her gym. The distance between `Pi` and her home is `Di`. 1 ≤ `i`, `j` ≤ `N` and `i` < `j` implies `Di` < `Dj`. She keeps on jogging until She reaches the gym from her home. Whenever she crosses a pole (other than the starting pole), she r

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