56 lines
873 B
Markdown
56 lines
873 B
Markdown
|
---
|
|||
|
id: 5900f41f1000cf542c50ff32
|
|||
|
challengeType: 5
|
|||
|
title: 'Problem 179: Consecutive positive divisors'
|
|||
|
videoUrl: ''
|
|||
|
localeTitle: 问题179:连续的正向除数
|
|||
|
---
|
|||
|
|
|||
|
## Description
|
|||
|
<section id="description">求整数1 <n <107,其中n和n + 1具有相同的正除数。例如,14具有正除数1,2,7,14而15具有1,3,5,15。 </section>
|
|||
|
|
|||
|
## Instructions
|
|||
|
<section id="instructions">
|
|||
|
</section>
|
|||
|
|
|||
|
## Tests
|
|||
|
<section id='tests'>
|
|||
|
|
|||
|
```yml
|
|||
|
tests:
|
|||
|
- text: <code>euler179()</code>应返回986262。
|
|||
|
testString: 'assert.strictEqual(euler179(), 986262, "<code>euler179()</code> should return 986262.");'
|
|||
|
|
|||
|
```
|
|||
|
|
|||
|
</section>
|
|||
|
|
|||
|
## Challenge Seed
|
|||
|
<section id='challengeSeed'>
|
|||
|
|
|||
|
<div id='js-seed'>
|
|||
|
|
|||
|
```js
|
|||
|
function euler179() {
|
|||
|
// Good luck!
|
|||
|
return true;
|
|||
|
}
|
|||
|
|
|||
|
euler179();
|
|||
|
|
|||
|
```
|
|||
|
|
|||
|
</div>
|
|||
|
|
|||
|
|
|||
|
|
|||
|
</section>
|
|||
|
|
|||
|
## Solution
|
|||
|
<section id='solution'>
|
|||
|
|
|||
|
```js
|
|||
|
// solution required
|
|||
|
```
|
|||
|
</section>
|