61460c8601
search and replace ```\n< with ```\n\n< to ensure there's an empty line before closing tags
57 lines
992 B
Markdown
57 lines
992 B
Markdown
---
|
||
id: 5900f3f51000cf542c50ff07
|
||
challengeType: 5
|
||
title: 'Problem 136: Singleton difference'
|
||
videoUrl: ''
|
||
localeTitle: 问题136：单身人士差异
|
||
---
|
||
|
||
## Description
|
||
<section id="description">正整数x，y和z是算术级数的连续项。假设n是一个正整数，当n = 20时，方程x2 - y2 - z2 = n恰好有一个解：132 - 102 - 72 = 20实际上有二十五个n低于一百的值，其中方程有一个独特的解决方案。 n小于五千万的有多少个值只有一个解？ </section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler136()</code>应返回2544559。
|
||
testString: assert.strictEqual(euler136(), 2544559);
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler136() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler136();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
|
||
/section>
|