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
551 B
Markdown
39 lines
551 B
Markdown
---
|
||
id: 5900f41f1000cf542c50ff32
|
||
title: 问题179：连续的正向除数
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-179-consecutive-positive-divisors
|
||
---
|
||
|
||
# --description--
|
||
|
||
求整数1 <n <107，其中n和n + 1具有相同的正除数。例如，14具有正除数1,2,7,14而15具有1,3,5,15。
|
||
|
||
# --hints--
|
||
|
||
`euler179()`应返回986262。
|
||
|
||
```js
|
||
assert.strictEqual(euler179(), 986262);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler179() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler179();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|