61460c8601
search and replace ```\n< with ```\n\n< to ensure there's an empty line before closing tags
57 lines
978 B
Markdown
57 lines
978 B
Markdown
---
|
||
id: 5900f3f31000cf542c50ff06
|
||
challengeType: 5
|
||
title: 'Problem 135: Same differences'
|
||
videoUrl: ''
|
||
localeTitle: 问题135：同样的差异
|
||
---
|
||
|
||
## Description
|
||
<section id="description">给定正整数，x，y和z是算术级数的连续项，正整数n的最小值，其中等式x2-y2-z2 = n，恰好有两个解是n = 27：342 - 272 - 202 = 122 - 92 - 62 = 27事实证明，n = 1155是具有正好十个解的最小值。 n不到一百万的多少个值有十个不同的解？ </section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler135()</code>应该返回4989。
|
||
testString: assert.strictEqual(euler135(), 4989);
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler135() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler135();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
|
||
/section>
|