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

852 B

Raw Blame History

id, title, challengeType, videoUrl, dashedName

id	title	challengeType	videoUrl	dashedName
5900f49d1000cf542c50ffb0	问题305：反身姿势	5		problem-305-reflexive-position

--description--

我们称S为（无限）字符串，该字符串是通过连接以10为底的连续正整数（从1开始）而形成的。

因此，S = 1234567891011121314151617181920212223242 ...

很容易看出，任何数字在S中都会显示无数次。

让我们将f（n）称为S中第n次出现n的起始位置。例如，f（1）= 1，f（5）= 81，f（12）= 271和f（7780）= 111111365。

求出∑f（3k）为1≤k≤13。

--hints--

euler305()应该返回18174995535140。

assert.strictEqual(euler305(), 18174995535140);

--seed--

--seed-contents--

function euler305() {

  return true;
}

euler305();

--solutions--

// solution required

852 B Raw Blame History Unescape Escape