ee1e8abd87
* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
47 lines
787 B
Markdown
47 lines
787 B
Markdown
---
|
||
id: 5900f4a21000cf542c50ffb5
|
||
title: 问题310：尼姆广场
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-310-nim-square
|
||
---
|
||
|
||
# --description--
|
||
|
||
爱丽丝和鲍勃玩游戏Nim Square。
|
||
|
||
Nim Square就像普通的三堆普通游戏Nim一样，但是玩家只能从堆中取出一平方的石头。
|
||
|
||
三个堆中的石头数量由有序三元组（a，b，c）表示。
|
||
|
||
如果0≤a≤b≤c≤29，则下一个玩家的失落位数为1160。
|
||
|
||
如果0≤a≤b≤c≤100000，则查找下一个玩家的失落位置数。
|
||
|
||
# --hints--
|
||
|
||
`euler310()`应该返回2586528661783。
|
||
|
||
```js
|
||
assert.strictEqual(euler310(), 2586528661783);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler310() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler310();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|