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
907 B
Markdown
41 lines
907 B
Markdown
---
|
||
id: 5900f3e01000cf542c50fef2
|
||
title: 问题114：计数块组合I
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-114-counting-block-combinations-i
|
||
---
|
||
|
||
# --description--
|
||
|
||
测量七个单元长度的行具有红色块，其上放置有最小长度为三个单元，使得任何两个红色块（允许为不同长度）由至少一个黑色方块隔开。有七种方法可以做到这一点。
|
||
|
||
一行可以测量多达50个长度的行数？注意：虽然上面的示例不适合这种可能性，但通常允许混合块大小。例如，在一个长度为8个单位的行上，您可以使用红色（3），黑色（1）和红色（4）。
|
||
|
||
# --hints--
|
||
|
||
`euler114()`应该返回16475640049。
|
||
|
||
```js
|
||
assert.strictEqual(euler114(), 16475640049);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler114() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler114();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|