67 lines
1.1 KiB
Markdown
67 lines
1.1 KiB
Markdown
|
---
|
||
|
|
id: 5
|
||
|
|
localeTitle: 5900f3c71000cf542c50feda
|
||
|
|
challengeType: 5
|
||
|
|
title: 'Problem 91: Right triangles with integer coordinates'
|
||
|
|
---
|
||
|
|
|
||
|
|
## Description
|
||
|
|
<section id='description'>
|
||
|
|
Los puntos P (x1, y1) y Q (x2, y2) se trazan en coordenadas de enteros y se unen al origen, O (0,0), para formar ΔOPQ.
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
Hay exactamente catorce triángulos que contienen un ángulo recto que pueden formarse cuando cada coordenada se encuentra entre 0 y 2 inclusive; es decir, 0 ≤ x1, y1, x2, y2 ≤ 2.
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
Dado que 0 ≤ x1, y1, x2, y2 ≤ 50, ¿cuántos triángulos rectos pueden formarse?
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Instructions
|
||
|
|
<section id='instructions'>
|
||
|
|
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Tests
|
||
|
|
<section id='tests'>
|
||
|
|
|
||
|
|
```yml
|
||
|
|
tests:
|
||
|
|
- text: <code>euler91()</code> debe devolver 14234.
|
||
|
|
testString: 'assert.strictEqual(euler91(), 14234, "<code>euler91()</code> should return 14234.");'
|
||
|
|
|
||
|
|
```
|
||
|
|
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Challenge Seed
|
||
|
|
<section id='challengeSeed'>
|
||
|
|
|
||
|
|
<div id='js-seed'>
|
||
|
|
|
||
|
|
```js
|
||
|
|
function euler91() {
|
||
|
|
// Good luck!
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
|
||
|
|
euler91();
|
||
|
|
```
|
||
|
|
|
||
|
|
</div>
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Solution
|
||
|
|
<section id='solution'>
|
||
|
|
|
||
|
|
```js
|
||
|
|
// solution required
|
||
|
|
```
|
||
|
|
</section>
|