56 lines
1.2 KiB
Markdown
56 lines
1.2 KiB
Markdown
---
|
||
id: 5900f3e01000cf542c50fef2
|
||
challengeType: 5
|
||
title: 'Problem 114: Counting block combinations I'
|
||
videoUrl: ''
|
||
localeTitle: 问题114:计数块组合I
|
||
---
|
||
|
||
## Description
|
||
<section id="description">测量七个单元长度的行具有红色块,其上放置有最小长度为三个单元,使得任何两个红色块(允许为不同长度)由至少一个黑色方块隔开。有七种方法可以做到这一点。 <p>一行可以测量多达50个长度的行数?注意:虽然上面的示例不适合这种可能性,但通常允许混合块大小。例如,在一个长度为8个单位的行上,您可以使用红色(3),黑色(1)和红色(4)。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler114()</code>应该返回16475640049。
|
||
testString: 'assert.strictEqual(euler114(), 16475640049, "<code>euler114()</code> should return 16475640049.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler114() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler114();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|