gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

chore(learn): Applied MDX format to Chinese curriculum files (#40462)

Browse Source
This commit is contained in:
Randell Dawson
2020-12-16 00:37:30 -07:00
committed by GitHub
parent 873fce02a2
commit 9ce4a02a41
1665 changed files with 58741 additions and 88042 deletions
Download Patch File Download Diff File Expand all files Collapse all files

48
curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-250-250250.md
View File

@ -1,55 +1,21 @@
---
id: 5900f4661000cf542c50ff78
title: 问题250：250250
challengeType: 5
videoUrl: ''
title: 问题250：250250
---
## Description
<section id="description">找到{11,22,33，...，250250250250}的非空子集的数量，其元素的总和可被250整除。输入最右边的16位作为答案。 </section>
# --description--
## Instructions
<section id="instructions">
</section>
找到{11,22,33，...，250250250250}的非空子集的数量，其元素的总和可被250整除。输入最右边的16位作为答案。
## Tests
<section id='tests'>
# --hints--
```yml
tests:
- text: <code>euler250()</code>应该返回1425480602091519。
testString: assert.strictEqual(euler250(), 1425480602091519);
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
`euler250()`应该返回1425480602091519。
```js
function euler250() {
// Good luck!
return true;
}
euler250();
assert.strictEqual(euler250(), 1425480602091519);
```
</div>
# --solutions--
</section>
## Solution
<section id='solution'>
```js
// solution required
```
/section>