freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-341-golombs-self-describing-sequence.md
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

798 B
Raw Blame History

id, title, challengeType, videoUrl, dashedName
id title challengeType videoUrl dashedName
5900f4c11000cf542c50ffd3 问题341Golomb的自我描述序列 5 problem-341-golombs-self-describing-sequence

--description--

Golomb的自描述序列{Gn}是唯一的非递减自然数序列因此n在序列中恰好出现Gn次。前几个n的Gn值是

n123456789101112131415 ... Gn的122334445556666 ...

给出G103= 86G106= 6137.对于1≤n<103还给出ΣGn3= 153506976。

找到ΣGn3为1≤n<106。

--hints--

euler341()应该返回56098610614277016。

assert.strictEqual(euler341(), 56098610614277016);

--seed--

--seed-contents--

function euler341() {

  return true;
}

euler341();

--solutions--

// solution required