freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-251-cardano-triplet...

56 lines
1022 B
Markdown
Raw Normal View History

---
id: 5900f4671000cf542c50ff7a
challengeType: 5
title: 'Problem 251: Cardano Triplets'
videoUrl: ''
localeTitle: 问题251卡尔达诺三胞胎
---
## Description
<section id="description">如果满足条件则正整数abc的三元组称为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, "<code>euler251()</code> should return 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>