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

54
curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-310-nim-square.md
View File

@ -1,63 +1,29 @@
---
id: 5900f4a21000cf542c50ffb5
title: 问题310：尼姆广场
challengeType: 5
videoUrl: ''
title: 问题310：尼姆广场
---
## Description
<section id="description">
# --description--
爱丽丝和鲍勃玩游戏Nim Square。
Nim Square就像普通的三堆普通游戏Nim一样，但是玩家只能从堆中取出一平方的石头。
三个堆中的石头数量由有序三元组（a，b，c）表示。
如果0≤a≤b≤c≤29，则下一个玩家的失落位数为1160。
如果0≤a≤b≤c≤100000，则查找下一个玩家的失落位置数。
</section>
## Instructions
<section id="instructions">
</section>
# --hints--
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler310()</code>应该返回2586528661783。
testString: assert.strictEqual(euler310(), 2586528661783);
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
`euler310()`应该返回2586528661783。
```js
function euler310() {
// Good luck!
return true;
}
euler310();
assert.strictEqual(euler310(), 2586528661783);
```
</div>
# --solutions--
</section>
## Solution
<section id='solution'>
```js
// solution required
```
/section>