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>
40 lines
793 B
Markdown
40 lines
793 B
Markdown
---
|
||
id: 5900f4181000cf542c50ff2a
|
||
title: 问题171：找到数字的平方和为正方形的数字
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: >-
|
||
problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square
|
||
---
|
||
|
||
# --description--
|
||
|
||
对于正整数n，令f（n）为n的数字（在基数10中）的平方和，例如f（3）= 32 = 9，f（25）= 22 + 52 = 4 + 25 = 29，f（442）= 42 + 42 + 22 = 16 + 16 + 4 = 36找到所有n的总和的最后九位数，0 <n <1020，使得f（n）是一个完美的平方。
|
||
|
||
# --hints--
|
||
|
||
`euler171()`应该返回142989277。
|
||
|
||
```js
|
||
assert.strictEqual(euler171(), 142989277);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler171() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler171();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|