Milkman

CodeChefOpen on judge ↗

Bob is a milkman. He wants to deliver $N$ milk packets to N houses i.e. one packet per house. The N houses are in a single line and Bob can only deliver milk packet in steps. In $iTh$ step, he deliver milk to one house and move $i$ houses forward.($i$ starts from 1). For example, if he starts with first house, he will deliver milk to the following houses - 1, 2, 4, 7, 11, ....(Lets denote this

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