freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-114-counting-block-combinations-i.md
Oliver Eyton-Williams ee1e8abd87
feat(curriculum): restore seed + solution to Chinese (#40683)
* 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>
2021-01-12 19:31:00 -07:00

1017 B

id, title, challengeType, forumTopicId, dashedName
id title challengeType forumTopicId dashedName
5900f3e01000cf542c50fef2 Problem 114: Counting block combinations I 5 301740 problem-114-counting-block-combinations-i

--description--

A row measuring seven units in length has red blocks with a minimum length of three units placed on it, such that any two red blocks (which are allowed to be different lengths) are separated by at least one black square. There are exactly seventeen ways of doing this.

How many ways can a row measuring fifty units in length be filled? NOTE: Although the example above does not lend itself to the possibility, in general it is permitted to mix block sizes. For example, on a row measuring eight units in length you could use red (3), black (1), and red (4).

--hints--

euler114() should return 16475640049.

assert.strictEqual(euler114(), 16475640049);

--seed--

--seed-contents--

function euler114() {

  return true;
}

euler114();

--solutions--

// solution required