ee1e8abd87
* 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>
39 lines
724 B
Markdown
39 lines
724 B
Markdown
---
|
||
id: 5900f4151000cf542c50ff27
|
||
title: 问题168：数字轮换
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-168-number-rotations
|
||
---
|
||
|
||
# --description--
|
||
|
||
考虑数字142857.我们可以通过将最后一个数字（7）移动到它的前面来右旋这个数字，给我们714285.可以验证714285 = 5×142857。这证明了142857的一个不寻常的属性：它是右旋的除数。找到具有此属性的所有整数n，10 <n <10100之和的最后5位数。
|
||
|
||
# --hints--
|
||
|
||
`euler168()`应返回`euler168()` 。
|
||
|
||
```js
|
||
assert.strictEqual(euler168(), 59206);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler168() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler168();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|