Sequence Sum

CodeChefOpen on judge ↗

You need to distribute sweets among $N$ children. The sweets are distributed in the following way - the first one gets $11$ sweets, the next child gets $17$ sweets, the next gets $23$ sweets, and so on. Sequence is **11, 17, 23, 29, .....** You need to find the total number of sweets needed to distribute among the first $N$ children. **NOTE**: Since answer can be large, print answer modulo $10^

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