56 lines
913 B
Markdown
56 lines
913 B
Markdown
---
|
||
id: 5900f4671000cf542c50ff79
|
||
challengeType: 5
|
||
title: 'Problem 249: Prime Subset Sums'
|
||
videoUrl: ''
|
||
localeTitle: 问题249：Prime子集总和
|
||
---
|
||
|
||
## Description
|
||
<section id="description">令S = {2,3,5，...，4999}为小于5000的素数集。求出S的子集数，其元素之和为素数。输入最右边的16位数字作为答案。 </section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler249()</code>应该返回9275262564250418。
|
||
testString: 'assert.strictEqual(euler249(), 9275262564250418, "<code>euler249()</code> should return 9275262564250418.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler249() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler249();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|