Minimum Area
CodeChefOpen on judge ↗
You are provided four points $p$ on $x$-axis, $q$ on $y$-axis, $r$(min - value on $x$-axis) and $s$(min - value on $y$-axis). Initially, $p≥r$ and $q≥s$. You can perform the following operation less than or equal to n times: Select either $p$ or $q$ and reduce it by $1$. Where point $p$ cannot become less than $r$, and point $q$ cannot become less than $s$. Find the minimum possible area under
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.
Sign in to chat with the tutor and save your progress.
Sign in to start