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
777 B
Markdown
41 lines
777 B
Markdown
---
|
||
id: 5900f4b11000cf542c50ffc3
|
||
title: 问题324：建造一座塔楼
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-324-building-a-tower
|
||
---
|
||
|
||
# --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。
|
||
|
||
求f（1010000）mod 100000007。
|
||
|
||
# --hints--
|
||
|
||
`euler324()`应该返回96972774。
|
||
|
||
```js
|
||
assert.strictEqual(euler324(), 96972774);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler324() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler324();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|