gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

chore(learn): Applied MDX format to Chinese curriculum files (#40462)

Browse Source
This commit is contained in:
Randell Dawson
2020-12-16 00:37:30 -07:00
committed by GitHub
parent 873fce02a2
commit 9ce4a02a41
1665 changed files with 58741 additions and 88042 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

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