Sanders visit

CodeChefOpen on judge ↗

Problem description. Sanders is planning to visit districts to campaign in order(0,1, 2,3..). But one district is blocked so Sanders cannot enter that district. He can perform N consecutive actions. The actions are numbered from 1 to N in order. When performing action X, Sander can either do nothing or move forward X districts skipping intermediate districts. If Sanders is in Yth district and per

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