freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-250-250250.chinese.md

id	challengeType	title	videoUrl	localeTitle
5900f4661000cf542c50ff78	5	Problem 250: 250250		问题250：250250

Description

找到{11,22,33，...，250250250250}的非空子集的数量，其元素的总和可被250整除。输入最右边的16位作为答案。

Instructions

Tests

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

Challenge Seed

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

euler250();

Solution

// solution required