ee1e8abd87
* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
39 lines
699 B
Markdown
39 lines
699 B
Markdown
---
|
||
id: 5900f3f31000cf542c50ff06
|
||
title: 问题135：同样的差异
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-135-same-differences
|
||
---
|
||
|
||
# --description--
|
||
|
||
给定正整数，x，y和z是算术级数的连续项，正整数n的最小值，其中等式x2-y2-z2 = n，恰好有两个解是n = 27：342 - 272 - 202 = 122 - 92 - 62 = 27事实证明，n = 1155是具有正好十个解的最小值。 n不到一百万的多少个值有十个不同的解？
|
||
|
||
# --hints--
|
||
|
||
`euler135()`应该返回4989。
|
||
|
||
```js
|
||
assert.strictEqual(euler135(), 4989);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler135() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler135();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|