56 lines
1.0 KiB
Markdown
56 lines
1.0 KiB
Markdown
---
|
||
id: 5900f4591000cf542c50ff6c
|
||
challengeType: 5
|
||
title: 'Problem 237: Tours on a 4 x n playing board'
|
||
videoUrl: ''
|
||
localeTitle: 问题237：在4 x n游戏板上游览
|
||
---
|
||
|
||
## Description
|
||
<section id="description">设T（n）为4×n游戏板上的游览次数，使得：游览从左上角开始。巡视包括向上，向下，向左或向右一个方格的移动。游览访问每个广场一次。游览结束于左下角。该图显示了4×10板上的一次巡视： <p> T（10）是2329.什么是T（1012）模108？ </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler237()</code>应该返回15836928。
|
||
testString: 'assert.strictEqual(euler237(), 15836928, "<code>euler237()</code> should return 15836928.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler237() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler237();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|