freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-91-right-triangles-with-integer-coordinates.md

id, title, challengeType, forumTopicId, dashedName

id	title	challengeType	forumTopicId	dashedName
5900f3c71000cf542c50feda	Problem 91: Right triangles with integer coordinates	5	302208	problem-91-right-triangles-with-integer-coordinates

--description--

The points P (x₁, y₁) and Q (x₂, y₂) are plotted at integer co-ordinates and are joined to the origin, O(0,0), to form ΔOPQ.

There are exactly fourteen triangles containing a right angle that can be formed when each co-ordinate lies between 0 and 2 inclusive; that is, 0 ≤ x₁, y₁, x₂, y₂ ≤ 2.

Given that 0 ≤ x₁, y₁, x₂, y₂ ≤ 50, how many right triangles can be formed?

--hints--

rightTrianglesIntCoords() should return a number.

assert(typeof rightTrianglesIntCoords() === 'number');

rightTrianglesIntCoords() should return 14234.

assert.strictEqual(rightTrianglesIntCoords(), 14234);

--seed--

--seed-contents--

function rightTrianglesIntCoords() {

  return true;
}

rightTrianglesIntCoords();

--solutions--

// solution required