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>
41 lines
814 B
Markdown
41 lines
814 B
Markdown
---
|
||
id: 5900f5061000cf542c510017
|
||
title: 问题409：Nim Extreme
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-409-nim-extreme
|
||
---
|
||
|
||
# --description--
|
||
|
||
设n是正整数。考虑nim位置：有n个非空桩。每堆的尺寸小于2n。没有两个桩具有相同的尺寸。设W（n）是满足上述条件的获胜nim位置的数量（如果第一个玩家具有获胜策略，则获胜的位置）。例如，W（1）= 1，W（2）= 6，W（3）= 168，W（5）= 19764360，W（100）mod 1 000 000 007 = 384777056。
|
||
|
||
求W（10 000 000）mod 1 000 000 007。
|
||
|
||
# --hints--
|
||
|
||
`euler409()`应该返回253223948。
|
||
|
||
```js
|
||
assert.strictEqual(euler409(), 253223948);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler409() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler409();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|