Shinchan and Magical Water Buckets

CodeChefOpen on judge ↗

Shinchan and sweety participating as a team in Infotsav15 coding contest coderush. She just solved a harder problem and leaves an easy one to Shinchan. The Task is: There are N water buckets numbered from 1 to N.The i th bucket needs i*i amount of water to fill completely. For each i Input - The First line contains an integer, T. - The next T lines contains integer S i.e. amount of total wat

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