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
5900f3971000cf542c50feaa	问题43：子串可分性	5		problem-43-sub-string-divisibility

--description--

数字1406357289是0到9的全数字，因为它是由0到9的每个数字以某种顺序组成的，但是它也具有相当有趣的子字符串可除性。

令d1为第一位数，d2为第二位数，依此类推。这样，我们注意以下几点：

d2d3d4 = 406可被2整除

d3d4d5 = 063被3整除

d4d5d6 = 635可被5整除

d5d6d7 = 357可被7整除

d6d7d8 = 572被11整除

d7d8d9 = 728被13整除

d8d9d10 = 289被17整除

使用此属性查找所有0到9个泛数字的数字。

--hints--

substringDivisibility()应该返回[1430952867, 1460357289, 1406357289, 4130952867, 4160357289, 4106357289]。

assert.deepEqual(substringDivisibility(), [
  1430952867,
  1460357289,
  1406357289,
  4130952867,
  4160357289,
  4106357289
]);

--seed--

--seed-contents--

function substringDivisibility() {

  return [];
}

substringDivisibility();

--solutions--

// solution required

1.1 KiB Raw Blame History Unescape Escape