ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 2165. Cake Cutter

Problem statement clarification
Posted by 👨🏻‍💻 Spatarel Dan Constantin 3 May 2026 07:52
For each possible triangulation, compute the smallest area triangle in it.
Print the largest smallest area triangle.

If that does not make much sense, let's go over the sample input:
The given quadrilateral can be triangulated in only two different ways. The areas of the resulting triangles are:

Cut #1: 11.5 + 16.0  (min. area triangle = 11.5)
Cut #2: 10.0 + 17.5  (min. area triangle = 10.0)
answer = max(11.5, 10.0) = 11.5

Good luck!