freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-251-cardano-triplets.md

---
id: 5900f4671000cf542c50ff7a
challengeType: 5
videoUrl: ''
title: 问题251：卡尔达诺三胞胎
---

## Description
<section id="description">如果满足条件，则正整数（a，b，c）的三元组称为Cardano三元组： <p>例如，（2,1,5）是Cardano Triplet。 </p><p>存在149个Cardano三胞胎，其中a + b +c≤1000。 </p><p>找出有多少卡尔达诺三胞胎存在，使a + b +c≤110,000,000。 </p></section>

## Instructions
<section id="instructions">
</section>

## Tests
<section id='tests'>

```yml
tests:
  - text: <code>euler251()</code>应该返回18946051。
    testString: assert.strictEqual(euler251(), 18946051);

```

</section>

## Challenge Seed
<section id='challengeSeed'>

<div id='js-seed'>

```js
function euler251() {
  // Good luck!
  return true;
}

euler251();

```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```

/section>