链接:https://acs.jxnu.edu.cn/problem/CF1C
题目:Ancient Berland Circus
描述:
Nowadays all circuses in Berland have a round arena with diameter 13 meters, but in the past things were different.
In Ancient Berland arenas in circuses were shaped as a regular (equiangular) polygon, the size and the number of angles could vary from one circus to another. In each corner of the arena there was a special pillar, and the rope strung between the pillars marked the arena edges.
Recently the scientists from Berland have discovered the remains of the ancient circus arena. They found only three pillars, the others were destroyed by the time.
You are given the coordinates of these three pillars. Find out what is the smallest area that the arena could have.
输入:
The input file consists of three lines, each of them contains a pair of numbers –– coordinates of the pillar. Any coordinate doesn't exceed 1000 by absolute value, and is given with at most six digits after decimal point.
输出:
Output the smallest possible area of the ancient arena. This number should be accurate to at least 6 digits after the decimal point. It's guaranteed that the number of angles in the optimal polygon is not larger than 100.
我的看法:古代的马戏团和现在的不同,在古代是形状规则的多边形。形状的大小以及角度应马戏团而异。在竞技场的每个角落里都有一根柱子,柱子上都绑着绳子标志竞技场的边界。现在有人发现了古代马戏团的遗迹,但只看见了三根柱子,其余都被破坏了。你的目的是根据三个柱子的位置来求这个竞技场的最小面积。
输入:
输入3行分别是三根柱子的坐标(所有坐标大小不会超过1000)
输出:
最小的面积(保留6位小数)保证角度不会超过100.