{"status": "success", "data": {"description_md": "*This is a user suggested problem. The TopsOJ staff thanks and gives full credit to [  Maximilian113](https://www.topsoj.com/users/Maximilian113/profile) for their contribution.*\n\n****\nLet $ABC$ be a triangle with perimeter $15$, and suppose that $\\displaystyle 16[ABC]^2 = (AB+BC+CA) \\cdot AB \\cdot BC \\cdot CA.$ If $[ABC]$ is of the form $\\frac{m\\sqrt{p}}{n},$ where $m$ and $n$ are relatively prime, positive integers, and $p$ is not divisible by the square of a prime, find $m+n+p.$", "description_html": "<p><em>This is a user suggested problem. The TopsOJ staff thanks and gives full credit to <a href=\"https://www.topsoj.com/users/Maximilian113/profile\">  Maximilian113</a> for their contribution.</em></p>&#10;<hr/>&#10;<p>Let <span class=\"katex--inline\">ABC</span> be a triangle with perimeter <span class=\"katex--inline\">15</span>, and suppose that <span class=\"katex--inline\">\\displaystyle 16[ABC]^2 = (AB+BC+CA) \\cdot AB \\cdot BC \\cdot CA.</span> If <span class=\"katex--inline\">[ABC]</span> is of the form <span class=\"katex--inline\">\\frac{m\\sqrt{p}}{n},</span> where <span class=\"katex--inline\">m</span> and <span class=\"katex--inline\">n</span> are relatively prime, positive integers, and <span class=\"katex--inline\">p</span> is not divisible by the square of a prime, find <span class=\"katex--inline\">m+n+p.</span></p>&#10;", "hints_md": "Try Heron's.", "hints_html": "<p>Try Heron&#8217;s.</p>&#10;", "editorial_md": "", "editorial_html": "", "flag_hint": "", "point_value": 5, "problem_name": "M1: A Triangle Problem", "can_next": false, "can_prev": false, "nxt": "", "prev": ""}}