56 lines
1.3 KiB
Markdown
56 lines
1.3 KiB
Markdown
|
---
|
|||
|
id: 5900f4341000cf542c50ff46
|
|||
|
challengeType: 5
|
|||
|
title: 'Problem 199: Iterative Circle Packing'
|
|||
|
videoUrl: ''
|
|||
|
localeTitle: 问题199:迭代圆包装
|
|||
|
---
|
|||
|
|
|||
|
## Description
|
|||
|
<section id="description">三个相等半径的圆放置在较大的圆内,使得每对圆彼此相切并且内圆不重叠。有四个未覆盖的“间隙”,它们将用更多的切圆迭代地填充。 <p>在每次迭代中,在每个间隙中放置最大尺寸的圆,这为下一次迭代创建了更多的间隙。经过3次迭代(如图)后,有108个间隙,未被圆圈覆盖的区域部分为0.06790342,四舍五入到小数点后8位。 </p><p> 10次迭代后,圆圈没有覆盖哪一部分区域?使用格式x.xxxxxxxx将您的答案四舍五入到小数点后八位。 </p></section>
|
|||
|
|
|||
|
## Instructions
|
|||
|
<section id="instructions">
|
|||
|
</section>
|
|||
|
|
|||
|
## Tests
|
|||
|
<section id='tests'>
|
|||
|
|
|||
|
```yml
|
|||
|
tests:
|
|||
|
- text: <code>euler199()</code>应该返回0.00396087。
|
|||
|
testString: 'assert.strictEqual(euler199(), 0.00396087, "<code>euler199()</code> should return 0.00396087.");'
|
|||
|
|
|||
|
```
|
|||
|
|
|||
|
</section>
|
|||
|
|
|||
|
## Challenge Seed
|
|||
|
<section id='challengeSeed'>
|
|||
|
|
|||
|
<div id='js-seed'>
|
|||
|
|
|||
|
```js
|
|||
|
function euler199() {
|
|||
|
// Good luck!
|
|||
|
return true;
|
|||
|
}
|
|||
|
|
|||
|
euler199();
|
|||
|
|
|||
|
```
|
|||
|
|
|||
|
</div>
|
|||
|
|
|||
|
|
|||
|
|
|||
|
</section>
|
|||
|
|
|||
|
## Solution
|
|||
|
<section id='solution'>
|
|||
|
|
|||
|
```js
|
|||
|
// solution required
|
|||
|
```
|
|||
|
</section>
|