freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-221-alexandrian-int...

56 lines
1.1 KiB
Markdown
Raw Blame History

This file contains ambiguous Unicode characters!

This file contains ambiguous Unicode characters that may be confused with others in your current locale. If your use case is intentional and legitimate, you can safely ignore this warning. Use the Escape button to highlight these characters.

---
id: 5900f4491000cf542c50ff5c
challengeType: 5
videoUrl: ''
title: 问题221亚历山大整数
---
## Description
<section id="description">如果存在整数pqr我们将调用正整数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 = 5q = -7r = -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);
```
</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>