Files
freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-142-perfect-square-collection.md

39 lines
665 B
Markdown
Raw Permalink Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

---
id: 5900f3fa1000cf542c50ff0d
title: '问题 142完全平方数合集'
challengeType: 5
forumTopicId: 301771
dashedName: problem-142-perfect-square-collection
---
# --description--
请找出最小的 $x + y + z$,其中整数 $x > y > z > 0$ 需要满足 $x + y$、$x y$、$x + z$、$x z$、$y + z$、$y z$ 均为完全平方数。
# --hints--
`perfectSquareCollection()` 应该返回 `1006193`
```js
assert.strictEqual(perfectSquareCollection(), 1006193);
```
# --seed--
## --seed-contents--
```js
function perfectSquareCollection() {
return true;
}
perfectSquareCollection();
```
# --solutions--
```js
// solution required
```