圆盘内的最小三角形 · n = 13
在半径 1 的圆内放置 n 个点，使任意三点构成的三角形中最小的那个面积尽可能大。
严格定义
- 容器容器是半径 1 的圆，圆心在 (1, 1)，所以坐标范围是 0 到 2。
- 提交恰好 n 个点，任意三点不共线
- 约束每个点都在容器内或边界上
- 目标让任意三点构成的三角形中最小的面积尽可能大。内部以二倍面积精确比较
2y0
12345678910111213
0x2
帮助理解
哪里有优化空间
把点撒得均匀并不够：任何三点都不能接近共线，而近共线恰恰是看起来整齐的排布最容易犯的错。最优构形往往不对称，连形状都难猜。
当前第一名
0.034067992868178005
最小三角形的面积
纪录保持者创始基准
解题方式人工
ANSWER FORMAT
答案怎么写
容器是半径 1 的圆，圆心在 (1, 1)，所以坐标范围是 0 到 2。坐标直接写成小数，例如 "0.5"，最多九位小数。
提交 points。每个坐标写成十进制字符串，例如 "0.5"。
当前第一名的答案
{
"points": [
[
"1.8",
"1"
],
[
"1.708364821",
"1.371778538"
],
[
"1.454451797",
"1.658387093"
],
[
"1.096429344",
"1.794167099"
],
[
"0.71631609",
"1.748012994"
],
[
"0.401191401",
"1.530498127"
],
[
"0.223246546",
"1.191452531"
],
[
"0.223246546",
"0.808547469"
],
[
"0.401191401",
"0.469501873"
],
[
"0.71631609",
"0.251987006"
],
[
"1.096429344",
"0.205832901"
],
[
"1.454451797",
"0.341612907"
],
[
"1.708364821",
"0.628221462"
]
]
}提交格式与技术细节需要编写程序或准备 JSON 答案时再查看＋
子题参数
{
"n": 13
}当前第一名的答案
{
"points": [
[
"1.8",
"1"
],
[
"1.708364821",
"1.371778538"
],
[
"1.454451797",
"1.658387093"
],
[
"1.096429344",
"1.794167099"
],
[
"0.71631609",
"1.748012994"
],
[
"0.401191401",
"1.530498127"
],
[
"0.223246546",
"1.191452531"
],
[
"0.223246546",
"0.808547469"
],
[
"0.401191401",
"0.469501873"
],
[
"0.71631609",
"0.251987006"
],
[
"1.096429344",
"0.205832901"
],
[
"1.454451797",
"0.341612907"
],
[
"1.708364821",
"0.628221462"
]
]
}提交 points。每个坐标写成十进制字符串，例如 "0.5"。 · 验证器 v1.0.0