56 lines
1.3 KiB
Markdown
56 lines
1.3 KiB
Markdown
|
---
|
|||
|
id: 5900f5081000cf542c510019
|
|||
|
challengeType: 5
|
|||
|
title: 'Problem 411: Uphill paths'
|
|||
|
videoUrl: ''
|
|||
|
localeTitle: 问题411:上坡路径
|
|||
|
---
|
|||
|
|
|||
|
## Description
|
|||
|
<section id="description">设n是正整数。假设坐标(x,y)=(2i mod n,3i mod n)的站点为0≤i≤2n。我们将考虑与同一站点具有相同坐标的站点。 <p>我们希望形成从(0,0)到(n,n)的路径,使得x和y坐标永不减少。设S(n)是路径可以通过的最大站数。 </p><p>例如,如果n = 22,则有11个不同的站,并且有效路径最多可以通过5个站。因此,S(22)= 5.下面举例说明了一个最佳路径的例子: </p><p>还可以证实S(123)= 14并且S(10000)= 48。 </p><p>求1Σk≤30,ΣS(k5)。 </p></section>
|
|||
|
|
|||
|
## Instructions
|
|||
|
<section id="instructions">
|
|||
|
</section>
|
|||
|
|
|||
|
## Tests
|
|||
|
<section id='tests'>
|
|||
|
|
|||
|
```yml
|
|||
|
tests:
|
|||
|
- text: <code>euler411()</code>应返回9936352。
|
|||
|
testString: 'assert.strictEqual(euler411(), 9936352, "<code>euler411()</code> should return 9936352.");'
|
|||
|
|
|||
|
```
|
|||
|
|
|||
|
</section>
|
|||
|
|
|||
|
## Challenge Seed
|
|||
|
<section id='challengeSeed'>
|
|||
|
|
|||
|
<div id='js-seed'>
|
|||
|
|
|||
|
```js
|
|||
|
function euler411() {
|
|||
|
// Good luck!
|
|||
|
return true;
|
|||
|
}
|
|||
|
|
|||
|
euler411();
|
|||
|
|
|||
|
```
|
|||
|
|
|||
|
</div>
|
|||
|
|
|||
|
|
|||
|
|
|||
|
</section>
|
|||
|
|
|||
|
## Solution
|
|||
|
<section id='solution'>
|
|||
|
|
|||
|
```js
|
|||
|
// solution required
|
|||
|
```
|
|||
|
</section>
|