Files
freeCodeCamp/curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-142-perfect-square-collection.md
2022-01-20 20:30:18 +01:00

39 lines
720 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 > 0$ について、$x + y$, $x y$, $x + z$, $x z$, $y + z$, $y z$ がすべて完全平方数となるような最小の $x + y + z$ を求めなさい。
# --hints--
`perfectSquareCollection()``1006193` を返す必要があります。
```js
assert.strictEqual(perfectSquareCollection(), 1006193);
```
# --seed--
## --seed-contents--
```js
function perfectSquareCollection() {
return true;
}
perfectSquareCollection();
```
# --solutions--
```js
// solution required
```