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

900 B

Raw Blame History

id, title, challengeType, videoUrl, dashedName

id	title	challengeType	videoUrl	dashedName
5900f4791000cf542c50ff8c	问题269：具有至少一个整数根的多项式	5		problem-269-polynomials-with-at-least-one-integer-root

--description--

多项式P（x）的根或零是等式P（x）= 0的解。将Pn定义为其系数是n的数字的多项式。例如，P5703（x）= 5x3 + 7x2 + 3。

我们可以看到：Pn（0）是n的最后一位，Pn（1）是n的位数之和，Pn（10）是n本身。定义Z（k）作为正整数的数量，n ，不超过多项式Pn具有至少一个整数根的k。

可以证实Z（100 000）是14696。

什么是Z（1016）？

--hints--

euler269()应该返回1311109198529286。

assert.strictEqual(euler269(), 1311109198529286);

--seed--

--seed-contents--

function euler269() {

  return true;
}

euler269();

--solutions--

// solution required

900 B Raw Blame History Unescape Escape