Fitting Rectangles
CodeChefOpen on judge ↗
To prepare for Equinox the team is making decorations, one of these decorations is a square, but they only have rectangular papers of ratio 1:n to make the square. Assume that the actual size of the rectangle can be anything as long as the sides are in ratio 1:$n$. You want to use exactly $k$ of these rectangles to make the square in such a way that there are _*no gaps or overlaps*_ Given n and k,
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