freeCodeCamp/problem-39-integer-right-triangles.spanish.md at 6ef8173f1b80e490ea076395d1293ca1791edad4

Files

Beau Carnes e3f9dc4b86 feat: add Spanish and language parser

2018-10-11 02:15:05 +05:30

1.5 KiB

Raw Blame History

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f3931000cf542c50fea6	5	Problem 39: Integer right triangles		Problema 39: triángulos rectos enteros

Description

Si p es el perímetro de un triángulo rectángulo con lados de longitud integral, {a, b, c}, hay exactamente tres soluciones para p = 120. {20,48,52}, {24,45,51}, { 30,40,50} ¿Para qué valor de p ≤ n, se maximiza el número de soluciones?

Instructions

Tests

tests:
  - text: <code>intRightTriangles(500)</code> debe devolver 420.
    testString: 'assert(intRightTriangles(500) == 420, "<code>intRightTriangles(500)</code> should return 420.");'
  - text: <code>intRightTriangles(800)</code> debe devolver 420.
    testString: 'assert(intRightTriangles(800) == 420, "<code>intRightTriangles(800)</code> should return 420.");'
  - text: <code>intRightTriangles(900)</code> debe devolver 840.
    testString: 'assert(intRightTriangles(900) == 840, "<code>intRightTriangles(900)</code> should return 840.");'
  - text: <code>intRightTriangles(1000)</code> debe devolver 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