55 lines
963 B
Markdown
55 lines
963 B
Markdown
---
|
||
id: 5900f3e21000cf542c50fef5
|
||
challengeType: 5
|
||
title: 'Problem 118: Pandigital prime sets'
|
||
videoUrl: ''
|
||
localeTitle: 问题118：Pandigital prime set
|
||
---
|
||
|
||
## Description
|
||
<section id="description">使用所有数字1到9并自由地连接它们以形成十进制整数，可以形成不同的集合。有趣的是，集合{2,5,47,89,631}，属于它的所有元素都是素数。包含每个数字1到9的多少个不同的集合只包含主要元素？ </section>
|
||
|
||
## Instructions
|
||
undefined
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler118()</code>应返回44680。
|
||
testString: 'assert.strictEqual(euler118(), 44680, "<code>euler118()</code> should return 44680.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler118() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler118();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|