ee1e8abd87
* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
39 lines
671 B
Markdown
39 lines
671 B
Markdown
---
|
||
id: 5900f3e21000cf542c50fef5
|
||
title: 问题118：Pandigital prime set
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-118-pandigital-prime-sets
|
||
---
|
||
|
||
# --description--
|
||
|
||
使用所有数字1到9并自由地连接它们以形成十进制整数，可以形成不同的集合。有趣的是，集合{2,5,47,89,631}，属于它的所有元素都是素数。包含每个数字1到9的多少个不同的集合只包含主要元素？
|
||
|
||
# --hints--
|
||
|
||
`euler118()`应返回44680。
|
||
|
||
```js
|
||
assert.strictEqual(euler118(), 44680);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler118() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler118();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|