freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-476-circle-packing-...

56 lines
1009 B
Markdown
Raw Normal View History

---
id: 5900f5481000cf542c51005b
challengeType: 5
videoUrl: ''
localeTitle: 问题476圆形包装II
---
## Description
<section id="description">令Rabc为具有边长ab和c的三角形内的三个非重叠圆所覆盖的最大面积。令Sn为Rabc在所有整数三元组abc上的平均值使得1≤a≤b≤c&lt;a +b≤n给出S2 = R1,1,1≈0.31998S5≈1.25899。查找S1803四舍五入到小数点后面的小数点后5位。 </section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler476()</code>应返回110242.87794。
testString: assert.strictEqual(euler476(), 110242.87794);
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function euler476() {
// Good luck!
return true;
}
euler476();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
/section>