freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-9-special-pythagorean-triplet.chinese.md

id	challengeType	title	videoUrl	localeTitle
5900f3761000cf542c50fe88	5	Problem 9: Special Pythagorean triplet		问题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, "<code>specialPythagoreanTriplet(1000)</code> should return 31875000.");'
  - text: <code>specialPythagoreanTriplet(24)</code>应该返回480。
    testString: 'assert.strictEqual(specialPythagoreanTriplet(24), 480, "<code>specialPythagoreanTriplet(24)</code> should return 480.");'
  - text: <code>specialPythagoreanTriplet(120)</code>应该返回49920。
    testString: 'assert.strictEqual(specialPythagoreanTriplet(120), 49920, "<code>specialPythagoreanTriplet(120)</code> should return 49920.");'

Challenge Seed

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

specialPythagoreanTriplet(1000);

Solution

// solution required