56 lines
1.4 KiB
Markdown
56 lines
1.4 KiB
Markdown
---
|
||
id: 5900f3c31000cf542c50fed5
|
||
challengeType: 5
|
||
title: 'Problem 86: Cuboid route'
|
||
videoUrl: ''
|
||
localeTitle: 问题86:长方体路线
|
||
---
|
||
|
||
## Description
|
||
<section id="description">一只蜘蛛S坐在一个长方形房间的一个角落里,尺寸为6乘5乘3,一只苍蝇F坐在对面的角落里。通过在房间的表面上行进,从S到F的最短“直线”距离是10并且路径在图上示出。 <p>但是,对于任何给定的长方体,最多有三个“最短”路径候选,并且最短路径并不总是具有整数长度。可以证明,正好有2060个不同的长方体,忽略旋转,具有整数尺寸,最大尺寸为M×M×M,当M = 100时,最短路径具有整数长度。这是最小值M的解决方案数首先超过两千;当M = 99时的解的数量是1975.找到M的最小值,使得解的数量首先超过一百万。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler86()</code>应该返回1818年。
|
||
testString: 'assert.strictEqual(euler86(), 1818, "<code>euler86()</code> should return 1818.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler86() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler86();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|