56 lines
1.1 KiB
Markdown
56 lines
1.1 KiB
Markdown
---
|
||
id: 5900f4b11000cf542c50ffc3
|
||
challengeType: 5
|
||
title: 'Problem 324: Building a tower'
|
||
videoUrl: ''
|
||
localeTitle: 问题324：建造一座塔楼
|
||
---
|
||
|
||
## Description
|
||
<section id="description">设f（n）表示用2×1×1的块填充3×3×n塔的方式的数量。你可以以任何你喜欢的方式旋转块;然而，塔本身的旋转，反射等被视为不同的。例如（q = 100000007）：f（2）= 229，f（4）= 117805，f（10）mod q = 96149360，f（103）mod q = 24806056，f（106）mod q = 30808124。 <p>求f（1010000）mod 100000007。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler324()</code>应该返回96972774。
|
||
testString: 'assert.strictEqual(euler324(), 96972774, "<code>euler324()</code> should return 96972774.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler324() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler324();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|