55 lines
1.2 KiB
Markdown
55 lines
1.2 KiB
Markdown
|
---
|
|||
|
|
id: 5900f40d1000cf542c50ff20
|
|||
|
|
challengeType: 5
|
|||
|
|
title: 'Problem 161: Triominoes'
|
|||
|
|
videoUrl: ''
|
|||
|
|
localeTitle: 问题161：Triominoes
|
|||
|
|
---
|
|||
|
|
|
|||
|
|
## Description
|
|||
|
|
<section id="description">三角形是由三个通过边缘连接的正方形组成的形状。有两种基本形式： <p>如果考虑所有可能的方向，则有六个： </p><p>任何n×m网格的nxm可以被3整除，可以用三角形平铺。如果我们考虑通过反射或从另一个平铺旋转获得的倾斜不同，有41种方式可以使用三角形平铺2乘9的网格： </p><p>有多少种方式可以通过三角形以这种方式平铺9乘12的网格？ </p></section>
|
|||
|
|
|
|||
|
|
## Instructions
|
|||
|
|
undefined
|
|||
|
|
|
|||
|
|
## Tests
|
|||
|
|
<section id='tests'>
|
|||
|
|
|
|||
|
|
```yml
|
|||
|
|
tests:
|
|||
|
|
- text: <code>euler161()</code>应该返回20574308184277972。
|
|||
|
|
testString: 'assert.strictEqual(euler161(), 20574308184277972, "<code>euler161()</code> should return 20574308184277972.");'
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Challenge Seed
|
|||
|
|
<section id='challengeSeed'>
|
|||
|
|
|
|||
|
|
<div id='js-seed'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
function euler161() {
|
|||
|
|
// Good luck!
|
|||
|
|
return true;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
euler161();
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Solution
|
|||
|
|
<section id='solution'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
// solution required
|
|||
|
|
```
|
|||
|
|
</section>
|