Devotee of god

CodeChefOpen on judge ↗

In a small village, there are $N$ number of temples in a row and rivers in front of each temple as shown in the figure for $N$ = 3. | | ^ | | ^ | | ^ where | | : river ^ : temple All $N$ temples have n different Gods. Shubhanshu, a deist (who believes in a god but not in religion) wants to visit all the $N$ temple. So, he decided to take $X$ flower with him for the offering. As he crosses the 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