56 lines
1.3 KiB
Markdown
56 lines
1.3 KiB
Markdown
|
---
|
|||
|
|
id: 5900f4461000cf542c50ff59
|
|||
|
|
challengeType: 5
|
|||
|
|
title: 'Problem 218: Perfect right-angled triangles'
|
|||
|
|
videoUrl: ''
|
|||
|
|
localeTitle: 问题218：完美的直角三角形
|
|||
|
|
---
|
|||
|
|
|
|||
|
|
## Description
|
|||
|
|
<section id="description">考虑具有边a = 7，b = 24和c = 25的直角三角形。这个三角形的面积是84，可以被完美的数字6和28整除。而且它是一个原始的直角三角形，因为gcd（a，b）= 1，gcd（b，c）= 1。 c也是一个完美的正方形。 <p>如果-it是一个原始的直角三角形，我们将称为直角三角形完美 - 斜边是一个完美的正方形</p><p>如果-it是一个完美的直角三角形，我们将称为直角三角形超完美，并且 - 区域是完美数字6和28的倍数。 </p><p>有多少c≤1016的完美直角三角形不是非常完美的？ </p></section>
|
|||
|
|
|
|||
|
|
## Instructions
|
|||
|
|
<section id="instructions">
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Tests
|
|||
|
|
<section id='tests'>
|
|||
|
|
|
|||
|
|
```yml
|
|||
|
|
tests:
|
|||
|
|
- text: <code>euler218()</code>应该返回0。
|
|||
|
|
testString: 'assert.strictEqual(euler218(), 0, "<code>euler218()</code> should return 0.");'
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Challenge Seed
|
|||
|
|
<section id='challengeSeed'>
|
|||
|
|
|
|||
|
|
<div id='js-seed'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
function euler218() {
|
|||
|
|
// Good luck!
|
|||
|
|
return true;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
euler218();
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Solution
|
|||
|
|
<section id='solution'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
// solution required
|
|||
|
|
```
|
|||
|
|
</section>
|