freeCodeCamp/problem-9-special-pythagorean-triplet.md at 5f956e9a16b45186aa7f3ed8590c1d23ba997624

Files

Oliver Eyton-Williams dec409a4bd fix: s/localeTitle/title/g

2020-10-06 23:10:08 +05:30

1.5 KiB

Raw Blame History

id, challengeType, videoUrl, title

id	challengeType	videoUrl	title
5900f3761000cf542c50fe88	5		问题9：特殊的毕达哥拉斯三重奏

Description

毕达哥拉斯三元组是一组三个自然数， a < b < c ，其中，

a ² + b ² = c ²

例如，3 ² + 4 ² = 9 + 16 = 25 = 5 ² 。恰好存在一个毕达哥拉斯三元组，其中a + b + c = 1000.求产品abc使得a + b + c = n 。

Instructions

Tests

tests:
  - text: <code>specialPythagoreanTriplet(1000)</code>应返回31875000。
    testString: assert.strictEqual(specialPythagoreanTriplet(1000), 31875000);
  - text: <code>specialPythagoreanTriplet(24)</code>应该返回480。
    testString: assert.strictEqual(specialPythagoreanTriplet(24), 480);
  - text: <code>specialPythagoreanTriplet(120)</code>应该返回49920。
    testString: assert([49920, 55080, 60000].includes(specialPythagoreanTriplet(120)));

Challenge Seed

function specialPythagoreanTriplet(n) {
 let sumOfabc = n;
 // Good luck!
 return true;
}

specialPythagoreanTriplet(1000);

Solution

// solution required

/section>

1.5 KiB Raw Blame History Unescape Escape