freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-237-tours-on-a-4-x-n-playing-board.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

744 B
Raw Blame History

id, title, challengeType, videoUrl, dashedName
id title challengeType videoUrl dashedName
5900f4591000cf542c50ff6c 问题237在4 x n游戏板上游览 5 problem-237-tours-on-a-4-x-n-playing-board

--description--

设Tn为4×n游戏板上的游览次数使得游览从左上角开始。巡视包括向上向下向左或向右一个方格的移动。游览访问每个广场一次。游览结束于左下角。该图显示了4×10板上的一次巡视

T10是2329.什么是T1012模108

--hints--

euler237()应该返回15836928。

assert.strictEqual(euler237(), 15836928);

--seed--

--seed-contents--

function euler237() {

  return true;
}

euler237();

--solutions--

// solution required