freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-249-prime-subset-sums.md

---
id: 5900f4671000cf542c50ff79
title: 问题249：Prime子集总和
challengeType: 5
videoUrl: ''
dashedName: problem-249-prime-subset-sums
---

# --description--

令S = {2,3,5，...，4999}为小于5000的素数集。求出S的子集数，其元素之和为素数。输入最右边的16位数字作为答案。

# --hints--

`euler249()`应该返回9275262564250418。

```js
assert.strictEqual(euler249(), 9275262564250418);
```

# --seed--

## --seed-contents--

```js
function euler249() {

  return true;
}

euler249();
```

# --solutions--

```js
// solution required
```