56 lines
810 B
Markdown
56 lines
810 B
Markdown
---
|
||
id: 5900f3c11000cf542c50fed4
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
title: 问题85：计算矩形
|
||
---
|
||
|
||
## Description
|
||
<section id="description">通过仔细计数可以看出，3×2的矩形网格包含十八个矩形： <p>虽然不存在包含正好两百万个矩形的矩形网格，但是找到最近解的网格区域。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler85()</code>应该返回2772。
|
||
testString: assert.strictEqual(euler85(), 2772);
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler85() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler85();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
|
||
/section>
|