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>
41 lines
602 B
Markdown
41 lines
602 B
Markdown
---
|
||
id: 5900f3c11000cf542c50fed4
|
||
title: 问题85：计算矩形
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-85-counting-rectangles
|
||
---
|
||
|
||
# --description--
|
||
|
||
通过仔细计数可以看出，3×2的矩形网格包含十八个矩形：
|
||
|
||
虽然不存在包含正好两百万个矩形的矩形网格，但是找到最近解的网格区域。
|
||
|
||
# --hints--
|
||
|
||
`euler85()`应该返回2772。
|
||
|
||
```js
|
||
assert.strictEqual(euler85(), 2772);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function countingRectangles() {
|
||
|
||
return true;
|
||
}
|
||
|
||
countingRectangles();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|