56 lines
1.1 KiB
Markdown
56 lines
1.1 KiB
Markdown
---
|
||
id: 5900f4f61000cf542c510008
|
||
challengeType: 5
|
||
title: 'Problem 393: Migrating ants'
|
||
videoUrl: ''
|
||
localeTitle: 问题393：迁移蚂蚁
|
||
---
|
||
|
||
## Description
|
||
<section id="description"> n×n正方形网格包含n2个蚂蚁，每平方一个蚂蚁。所有蚂蚁决定同时移动到相邻的广场（通常有4种可能，除了网格边缘或角落处的蚂蚁）。我们将f（n）定义为在没有任何蚂蚁在同一个正方形上结束并且没有任何两个蚂蚁穿过两个正方形之间的相同边缘时可以发生的方式的数量。 <p>给出f（4）= 88.求f（10）。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler393()</code>应该返回112398351350823100。
|
||
testString: 'assert.strictEqual(euler393(), 112398351350823100, "<code>euler393()</code> should return 112398351350823100.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler393() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler393();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|