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

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

Description

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

Instructions

Tests

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

Challenge Seed

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

euler249();

Solution

// solution required