freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-276-primitive-triangles.chinese.md

id	challengeType	title	videoUrl	localeTitle
5900f4801000cf542c50ff93	5	Problem 276: Primitive Triangles		问题276：原始三角形

Description

考虑具有整数边a，b和c的三角形，其中a≤b≤c。如果gcd（a，b，c）= 1，则整数边三角形（a，b，c）称为基元。存在多少个原始整数边三角形，周长不超过10 000 000？

Instructions

Tests

tests:
  - text: <code>euler276()</code>应该返回5777137137739633000。
    testString: 'assert.strictEqual(euler276(), 5777137137739633000, "<code>euler276()</code> should return 5777137137739633000.");'

Challenge Seed

function euler276() {
  // Good luck!
  return true;
}

euler276();

Solution

// solution required