Goa Carnival

CodeChefOpen on judge ↗

Goa carnival is coming , carnival consists of $n$ stalls,arranged in a circle. The stalls are numbered 1 through $n$ clockwise with $n$ being adjacent to 1. The $i$-th stall sells some candies for the price of $a_i$ rupees per item. Each stall has an unlimited supply of candies. Roger has decided to spend at most $T$ Rupees at the carnival .However, he has some plan in mind for his path across

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