56 lines
1.1 KiB
Markdown
56 lines
1.1 KiB
Markdown
---
|
||
id: 5900f3e21000cf542c50fef4
|
||
challengeType: 5
|
||
title: 'Problem 117: Red, green, and blue tiles'
|
||
videoUrl: ''
|
||
localeTitle: 问题117：红色，绿色和蓝色瓷砖
|
||
---
|
||
|
||
## Description
|
||
<section id="description">使用黑色正方形瓷砖和椭圆形瓷砖的组合，选自：测量两个单位的红色瓷砖，测量三个单位的绿色瓷砖和测量四个单位的蓝色瓷砖，可以以十五种不同的方式平铺一个长度为五个单位的行。 <p>一行测量五十个单位长度的平铺方式有多少？注意：这与问题116有关。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler117()</code>应该返回100808458960497。
|
||
testString: 'assert.strictEqual(euler117(), 100808458960497, "<code>euler117()</code> should return 100808458960497.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler117() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler117();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|