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>
45 lines
856 B
Markdown
45 lines
856 B
Markdown
---
|
||
id: 5900f40d1000cf542c50ff20
|
||
title: 问题161：Triominoes
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-161-triominoes
|
||
---
|
||
|
||
# --description--
|
||
|
||
三角形是由三个通过边缘连接的正方形组成的形状。有两种基本形式：
|
||
|
||
如果考虑所有可能的方向，则有六个：
|
||
|
||
任何n×m网格的nxm可以被3整除，可以用三角形平铺。如果我们考虑通过反射或从另一个平铺旋转获得的倾斜不同，有41种方式可以使用三角形平铺2乘9的网格：
|
||
|
||
有多少种方式可以通过三角形以这种方式平铺9乘12的网格？
|
||
|
||
# --hints--
|
||
|
||
`euler161()`应该返回20574308184277972。
|
||
|
||
```js
|
||
assert.strictEqual(euler161(), 20574308184277972);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler161() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler161();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|