freeCodeCamp

1.5 KiB

Raw Blame History

id	challengeType	title	videoUrl	localeTitle
5900f3931000cf542c50fea6	5	Problem 39: Integer right triangles		Problema 39: Triângulos retos inteiros

Description

Se p é o perímetro de um triângulo de ângulo reto com lados de comprimento integral, {a, b, c}, existem exatamente três soluções para p = 120. {20,48,52}, {24,45,51}, { 30,40,50} Para qual valor de p ≤ n, o número de soluções é maximizado?

Instructions

Tests

tests:
  - text: <code>intRightTriangles(500)</code> deve retornar 420.
    testString: 'assert(intRightTriangles(500) == 420, "<code>intRightTriangles(500)</code> should return 420.");'
  - text: <code>intRightTriangles(800)</code> deve retornar 420.
    testString: 'assert(intRightTriangles(800) == 420, "<code>intRightTriangles(800)</code> should return 420.");'
  - text: <code>intRightTriangles(900)</code> deve retornar 840.
    testString: 'assert(intRightTriangles(900) == 840, "<code>intRightTriangles(900)</code> should return 840.");'
  - text: <code>intRightTriangles(1000)</code> deve retornar 840.
    testString: 'assert(intRightTriangles(1000) == 840, "<code>intRightTriangles(1000)</code> should return 840.");'

Challenge Seed

function intRightTriangles(n) {
  // Good luck!
  return n;
}

intRightTriangles(1000);

Solution

// solution required

1.5 KiB Raw Blame History