56 lines
1.2 KiB
Markdown
56 lines
1.2 KiB
Markdown
|
---
|
|||
|
|
id: 5900f4491000cf542c50ff5c
|
|||
|
|
challengeType: 5
|
|||
|
|
title: 'Problem 221: Alexandrian Integers'
|
|||
|
|
videoUrl: ''
|
|||
|
|
localeTitle: 问题221：亚历山大整数
|
|||
|
|
---
|
|||
|
|
|
|||
|
|
## Description
|
|||
|
|
<section id="description">如果存在整数p，q，r，我们将调用正整数A和“亚历山大整数”，这样： <pre> <code> A = p · q · r and 1A</code> </pre><p> = </p><pre> <code> 1p</code> </pre><p> + </p><pre> <code> 1q</code> </pre><p> + </p><pre> <code> 1r</code> </pre><p>例如，630是亚历山大整数（p = 5，q = -7，r = -18）。实际上，630是第6个亚历山大整数，前6个亚历山大整数是：6,42,120,156,420和630。 </p><p>找到第150000个亚历山大整数。 </p></section>
|
|||
|
|
|
|||
|
|
## Instructions
|
|||
|
|
<section id="instructions">
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Tests
|
|||
|
|
<section id='tests'>
|
|||
|
|
|
|||
|
|
```yml
|
|||
|
|
tests:
|
|||
|
|
- text: <code>euler221()</code>应该返回1884161251122450。
|
|||
|
|
testString: 'assert.strictEqual(euler221(), 1884161251122450, "<code>euler221()</code> should return 1884161251122450.");'
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Challenge Seed
|
|||
|
|
<section id='challengeSeed'>
|
|||
|
|
|
|||
|
|
<div id='js-seed'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
function euler221() {
|
|||
|
|
// Good luck!
|
|||
|
|
return true;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
euler221();
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Solution
|
|||
|
|
<section id='solution'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
// solution required
|
|||
|
|
```
|
|||
|
|
</section>
|