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
831 B
Markdown
41 lines
831 B
Markdown
---
|
||
id: 5900f4f61000cf542c510008
|
||
title: 问题393：迁移蚂蚁
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-393-migrating-ants
|
||
---
|
||
|
||
# --description--
|
||
|
||
n×n正方形网格包含n2个蚂蚁，每平方一个蚂蚁。所有蚂蚁决定同时移动到相邻的广场（通常有4种可能，除了网格边缘或角落处的蚂蚁）。我们将f（n）定义为在没有任何蚂蚁在同一个正方形上结束并且没有任何两个蚂蚁穿过两个正方形之间的相同边缘时可以发生的方式的数量。
|
||
|
||
给出f（4）= 88.求f（10）。
|
||
|
||
# --hints--
|
||
|
||
`euler393()`应该返回112398351350823100。
|
||
|
||
```js
|
||
assert.strictEqual(euler393(), 112398351350823100);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler393() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler393();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|