Inscribed Bicycle

AtCoder

IDcf16_exhibition_final_b

Time2000ms

Memory256MB

Difficulty—

#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 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. ## Constraints * $0 ≤ x_i, y_i ≤ 1000$ * The coordinates are integers. * The three points are not on the same line. ## Input The input is given from Standard Input in the following format: $x_1$ $y_1$ $x_2$ $y_2$ $x_3$ $y_3$ [samples]

Samples

Input #1

0 0
1 1
2 0

Output #1

0.292893218813

Input #2

3 1
1 5
4 9

Output #2

0.889055514217

API Response (JSON)

{
  "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 circle...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments