56 lines
961 B
Markdown
56 lines
961 B
Markdown
---
|
||
id: 5900f4151000cf542c50ff27
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
title: 问题168：数字轮换
|
||
---
|
||
|
||
## Description
|
||
<section id="description">考虑数字142857.我们可以通过将最后一个数字（7）移动到它的前面来右旋这个数字，给我们714285.可以验证714285 = 5×142857。这证明了142857的一个不寻常的属性：它是右旋的除数。找到具有此属性的所有整数n，10 <n <10100之和的最后5位数。 </section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler168()</code>应返回<code>euler168()</code> 。
|
||
testString: assert.strictEqual(euler168(), 59206);
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler168() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler168();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
|
||
/section>
|