ee1e8abd87
* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
39 lines
778 B
Markdown
39 lines
778 B
Markdown
---
|
||
id: 5900f5481000cf542c51005b
|
||
title: 问题476：圆形包装II
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-476-circle-packing-ii
|
||
---
|
||
|
||
# --description--
|
||
|
||
令R（a，b，c）为具有边长a，b和c的三角形内的三个非重叠圆所覆盖的最大面积。令S（n）为R（a，b，c）在所有整数三元组（a，b，c）上的平均值，使得1≤a≤b≤c<a +b≤n给出S（2） ）= R（1,1,1）≈0.31998，S（5）≈1.25899。查找S（1803）四舍五入到小数点后面的小数点后5位。
|
||
|
||
# --hints--
|
||
|
||
`euler476()`应返回110242.87794。
|
||
|
||
```js
|
||
assert.strictEqual(euler476(), 110242.87794);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler476() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler476();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|