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
713 B
Markdown
39 lines
713 B
Markdown
---
|
||
id: 5900f3f51000cf542c50ff07
|
||
title: 问题136：单身人士差异
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-136-singleton-difference
|
||
---
|
||
|
||
# --description--
|
||
|
||
正整数x，y和z是算术级数的连续项。假设n是一个正整数，当n = 20时，方程x2 - y2 - z2 = n恰好有一个解：132 - 102 - 72 = 20实际上有二十五个n低于一百的值，其中方程有一个独特的解决方案。 n小于五千万的有多少个值只有一个解？
|
||
|
||
# --hints--
|
||
|
||
`euler136()`应返回2544559。
|
||
|
||
```js
|
||
assert.strictEqual(euler136(), 2544559);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler136() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler136();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|