56 lines
1.4 KiB
Markdown
56 lines
1.4 KiB
Markdown
---
|
||
id: 5900f3b71000cf542c50feca
|
||
challengeType: 5
|
||
title: 'Problem 75: Singular integer right triangles'
|
||
videoUrl: ''
|
||
localeTitle: 问题75:奇异整数直角三角形
|
||
---
|
||
|
||
## Description
|
||
<section id="description">事实证明,12厘米是最小的导线长度,可以弯曲形成一个完整的直角三角形,只有一种方式,但还有更多的例子。 12 cm:(3,4,5)24 cm:(6,8,10)30 cm:(5,12,13)36 cm:(9,12,15)40 cm:(8,15,17) 48厘米:(12,16,20)相比之下,一些长度的线,如20厘米,不能弯曲形成整数个直角三角形,其他长度允许找到多个解决方案;例如,使用120厘米,可以精确地形成三个不同的整数侧直角三角形。 120厘米:(30,40,50),(20,48,52),(24,45,51)假设L是线的长度,L≤1,500,000的多少个数值恰好可以是一个整数的右边角三角形成? </section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler75()</code>应返回161667。
|
||
testString: 'assert.strictEqual(euler75(), 161667, "<code>euler75()</code> should return 161667.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler75() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler75();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|