Horses Love Hay!

CodeChefOpen on judge ↗

Sanket owns a stable that has $X$ horses and $N$ haystacks. Each haystack is of **variable** size. To maintain equal growth of each horse he wants to feed the **same quantity** of hay to all his horses. The haystacks can be divided into multiple smaller stacks of different sizes but cannot combine $2$ or more stacks together. *Help Sanket find the **maximum** size of haystack each horse can get

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