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

961 B

Raw Blame History

id, title, challengeType, videoUrl, dashedName

id	title	challengeType	videoUrl	dashedName
5900f41a1000cf542c50ff2c	问题173：使用多达一百万个瓷砖可以形成多少个不同的“空心”方形薄片？	5		problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed

--description--

我们将方形薄片定义为具有方形“孔”的方形轮廓，使得该形状具有垂直和水平对称性。例如，使用正好三十二平方的瓷砖，我们可以形成两个不同的方形薄片：

使用一百个瓷砖，并且不一定一次使用所有瓷砖，可以形成四十一个不同的方形薄片。使用多达一百万个瓷砖可以形成多少个不同的方形薄片？

--hints--

euler173()应该返回1572729。

assert.strictEqual(euler173(), 1572729);

--seed--

--seed-contents--

function euler173() {

  return true;
}

euler173();

--solutions--

// solution required

961 B Raw Blame History Unescape Escape