{"problem":{"name":"Inscribed Bicycle","description":{"content":"#nck { width: 30px; height: auto; }Snuke received a triangle as a birthday present. The coordinates of the three vertices were $(x_1, y_1)$, $(x_2, y_2)$, and $(x_3, y_3)$. He wants to draw two circle","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"cf16_exhibition_final_b"},"statements":[{"statement_type":"Markdown","content":"#nck { width: 30px; height: auto; }Snuke received a triangle as a birthday present. The coordinates of the three vertices were $(x_1, y_1)$, $(x_2, y_2)$, and $(x_3, y_3)$.\nHe wants to draw two circles with the same radius inside the triangle such that the two circles do not overlap (but they may touch). Compute the maximum possible radius of the circles.\n\n## Constraints\n\n*   $0 ≤ x_i, y_i ≤ 1000$\n*   The coordinates are integers.\n*   The three points are not on the same line.\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$x_1$ $y_1$\n$x_2$ $y_2$\n$x_3$ $y_3$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"cf16_exhibition_final_b","tags":[],"sample_group":[["0 0\n1 1\n2 0","0.292893218813"],["3 1\n1 5\n4 9","0.889055514217"]],"created_at":"2026-03-03 11:01:14"}}