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

1.1 KiB

Raw Blame History

id, title, challengeType, videoUrl, dashedName

id	title	challengeType	videoUrl	dashedName
5900f40e1000cf542c50ff21	问题162：十六进制数	5		problem-162-hexadecimal-numbers

--description--

在十六进制数中，系统使用16个不同的数字表示数字：0,1,2,3,4,5,6,7,8,9，A，B，C，D，E，F写入时的十六进制数AF在十进制数系统中等于10x16 + 15 = 175。在3位十六进制数10A，1A0，A10和A01中，数字0,1和A都存在。就像用十进制数写的数字一样，我们写十六进制数而不带前导零。包含最多十六个十六进制数字的十六进制数是多少，所有数字0,1和A至少出现一次？将答案作为十六进制数字给出。（A，B，C，D，E和F大写，没有任何前导或尾随代码将数字标记为十六进制且没有前导零，例如1A3F而不是：1a3f而不是0x1a3f而不是$ 1A3F而不是＃1A3F而不是0000001A3F）

--hints--

euler162() 应该返回3D58725572C62302。

assert.strictEqual(euler162(), '3D58725572C62302');

--seed--

--seed-contents--

function euler162() {

  return true;
}

euler162();

--solutions--

// solution required

1.1 KiB Raw Blame History Unescape Escape