Stud-Max-Buoy

CodeChefOpen on judge ↗

Every college has a $stud-max$ buoy. $JGEC$ has its own $Atul$ who loves to impress everyone with his smile. A presentation is going on at the auditorium where there are $N$ rows of $M$ chairs with people sitting on it. Everyone votes for Atul's presentation skills, but Atul is interested in knowing the $maximum$ amount of vote that he receives either taking $K$ people $vertically$ or $horizontall

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