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

939 B

Raw Blame History

id, title, challengeType, videoUrl, dashedName

id	title	challengeType	videoUrl	dashedName
5900f4e01000cf542c50fff2	问题371：车牌	5		problem-371-licence-plates

--description--

俄勒冈车牌由三个字母后跟一个三位数组成（每个数字可以是[0..9]）。开车上班时，赛斯玩下面的游戏：每当他旅行中看到的两个牌照的数量增加到1000就是胜利。

例如，MIC-012和HAN-988也是胜利，RYU-500和SET-500也是如此。（只要他在同一次旅行中看到他们）。

找到他想要获胜的预期牌照数量。将您的答案四舍五入到小数点后面的小数点后8位。

注意：我们假设所看到的每个牌照同样可能有三位数字。

--hints--

euler371()应返回40.66368097。

assert.strictEqual(euler371(), 40.66368097);

--seed--

--seed-contents--

function euler371() {

  return true;
}

euler371();

--solutions--

// solution required

939 B Raw Blame History Unescape Escape