freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-187-semiprimes.md

56 lines
951 B
Markdown
Raw Normal View History

---
id: 5900f4291000cf542c50ff3a
challengeType: 5
videoUrl: ''
localeTitle: 问题187半致
---
## Description
<section id="description">复合是包含至少两个素因子的数字。例如15 = 3×5; 9 = 3×3; 12 = 2×2×3。 <p>在30以下有十种复合材料恰好包含两个不一定是不同的主要因素4,6,9,10,14,15,21,22,25,26。 </p><p>有多少复合整数n &lt;108恰好有两个不一定是不同的素因子 </p></section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler187()</code>应该返回17427258。
testString: assert.strictEqual(euler187(), 17427258);
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function euler187() {
// Good luck!
return true;
}
euler187();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
/section>