56 lines
1.6 KiB
Markdown
56 lines
1.6 KiB
Markdown
|
---
|
|||
|
|
id: 5900f3b01000cf542c50fec3
|
|||
|
|
challengeType: 5
|
|||
|
|
title: 'Problem 68: Magic 5-gon ring'
|
|||
|
|
videoUrl: ''
|
|||
|
|
localeTitle: 问题68：魔法5-gon戒指
|
|||
|
|
---
|
|||
|
|
|
|||
|
|
## Description
|
|||
|
|
<section id="description">考虑以下“魔术”3-gon环，填充数字1到6，每行加9。 <p>顺时针工作，并从具有数字最低外部节点（在该示例中为4,3,2）的三个一组开始，可以唯一地描述每个解决方案。例如，上述解决方案可以通过集合来描述：4,3,2; 6,2,1; 5,1,3。可以用四种不同的总数来完成环：9,10,11和12.总共有八种解决方案。 </p><p> TotalSolution Set 94,2,3; 5,3,1; 6,1,2 94,3,2; 6,2,1; 5,1,3 102,3,5; 4,5,1; 6,1,3 102,5,3; 6,3,1; 4,1,5 111,4,6; 3,6,2; 5,2,4 111,6,4; 5,4,2; 3,2,6 121,5,6; 2,6,4; 3,4,5 121,6,5; 3,5,4; 2,4,6 </p><p>通过连接每个组，可以形成9位数的字符串; 3-gon环的最大字符串是432621513.使用数字1到10，并根据排列，可以形成16位和17位字符串。 “魔法”5-gon戒指的最大16位数字串是多少？ </p></section>
|
|||
|
|
|
|||
|
|
## Instructions
|
|||
|
|
<section id="instructions">
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Tests
|
|||
|
|
<section id='tests'>
|
|||
|
|
|
|||
|
|
```yml
|
|||
|
|
tests:
|
|||
|
|
- text: <code>euler68()</code>应该返回6531031914842725。
|
|||
|
|
testString: 'assert.strictEqual(euler68(), 6531031914842725, "<code>euler68()</code> should return 6531031914842725.");'
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Challenge Seed
|
|||
|
|
<section id='challengeSeed'>
|
|||
|
|
|
|||
|
|
<div id='js-seed'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
function euler68() {
|
|||
|
|
// Good luck!
|
|||
|
|
return true;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
euler68();
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Solution
|
|||
|
|
<section id='solution'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
// solution required
|
|||
|
|
```
|
|||
|
|
</section>
|