freeCodeCamp/problem-249-prime-subset-sums.chinese.md at ff8db8ce9e8413f490626e1572e7fd09825db39c

Files

Oliver Eyton-Williams 61460c8601 fix: insert blank line after ```

search and replace ```\n< with ```\n\n< to ensure there's an empty line
before closing tags

2020-08-16 04:45:20 +05:30

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f4671000cf542c50ff79	5	Problem 249: Prime Subset Sums		问题249：Prime子集总和

Description

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

tests:
  - text: <code>euler249()</code>应该返回9275262564250418。
    testString: assert.strictEqual(euler249(), 9275262564250418);

function euler249() {
  // Good luck!
  return true;
}

euler249();

// solution required

/section>