56 lines
988 B
Markdown
56 lines
988 B
Markdown
---
|
||
id: 5900f4801000cf542c50ff93
|
||
challengeType: 5
|
||
title: 'Problem 276: Primitive Triangles'
|
||
videoUrl: ''
|
||
localeTitle: 问题276：原始三角形
|
||
---
|
||
|
||
## Description
|
||
<section id="description">考虑具有整数边a，b和c的三角形，其中a≤b≤c。如果gcd（a，b，c）= 1，则整数边三角形（a，b，c）称为基元。存在多少个原始整数边三角形，周长不超过10 000 000？ </section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler276()</code>应该返回5777137137739633000。
|
||
testString: 'assert.strictEqual(euler276(), 5777137137739633000, "<code>euler276()</code> should return 5777137137739633000.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler276() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler276();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|