64 lines
1.4 KiB
Markdown
64 lines
1.4 KiB
Markdown
---
|
||
id: 5900f3931000cf542c50fea6
|
||
challengeType: 5
|
||
title: 'Problem 39: Integer right triangles'
|
||
forumTopicId: 302054
|
||
localeTitle: 'Problem 39: Integer right triangles'
|
||
---
|
||
|
||
## Description
|
||
<section id='description'>
|
||
Если p - периметр прямоугольного треугольника со сторонами целой длины, {a, b, c}, то существует ровно три решения для p = 120. {20,48,52}, {24,45,51}, { 30,40,50} Для какого значения p ≤ n, число решений максимизировано?
|
||
</section>
|
||
|
||
## Instructions
|
||
<section id='instructions'>
|
||
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>intRightTriangles(500)</code> should return 420.
|
||
testString: assert(intRightTriangles(500) == 420);
|
||
- text: <code>intRightTriangles(800)</code> should return 420.
|
||
testString: assert(intRightTriangles(800) == 420);
|
||
- text: <code>intRightTriangles(900)</code> should return 840.
|
||
testString: assert(intRightTriangles(900) == 840);
|
||
- text: <code>intRightTriangles(1000)</code> should return 840.
|
||
testString: assert(intRightTriangles(1000) == 840);
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function intRightTriangles(n) {
|
||
// Good luck!
|
||
return n;
|
||
}
|
||
|
||
intRightTriangles(1000);
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
|
||
</section>
|