Oliver Eyton-Williams ee1e8abd87
feat(curriculum): restore seed + solution to Chinese (#40683)
* 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>
2021-01-12 19:31:00 -07:00

41 lines
1.1 KiB
Markdown
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

---
id: 5900f3c31000cf542c50fed5
title: 问题86长方体路线
challengeType: 5
videoUrl: ''
dashedName: problem-86-cuboid-route
---
# --description--
一只蜘蛛S坐在一个长方形房间的一个角落里尺寸为6乘5乘3一只苍蝇F坐在对面的角落里。通过在房间的表面上行进从S到F的最短“直线”距离是10并且路径在图上示出。
但是对于任何给定的长方体最多有三个“最短”路径候选并且最短路径并不总是具有整数长度。可以证明正好有2060个不同的长方体忽略旋转具有整数尺寸最大尺寸为M×M×M当M = 100时最短路径具有整数长度。这是最小值M的解决方案数首先超过两千;当M = 99时的解的数量是1975.找到M的最小值使得解的数量首先超过一百万。
# --hints--
`euler86()`应该返回1818年。
```js
assert.strictEqual(euler86(), 1818);
```
# --seed--
## --seed-contents--
```js
function cuboidRoute() {
return true;
}
cuboidRoute();
```
# --solutions--
```js
// solution required
```