56 lines
1.1 KiB
Markdown
56 lines
1.1 KiB
Markdown
---
|
||
id: 5900f5481000cf542c51005b
|
||
challengeType: 5
|
||
title: 'Problem 476: Circle Packing II'
|
||
videoUrl: ''
|
||
localeTitle: 问题476:圆形包装II
|
||
---
|
||
|
||
## Description
|
||
<section id="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位。 </section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler476()</code>应返回110242.87794。
|
||
testString: 'assert.strictEqual(euler476(), 110242.87794, "<code>euler476()</code> should return 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>
|