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

804 B

Raw Blame History

id, title, challengeType, videoUrl, dashedName

id	title	challengeType	videoUrl	dashedName
5900f48d1000cf542c50ff9f	问题288：一个巨大的阶乘	5		problem-288-an-enormous-factorial

--description--

对于任何素数p，数N（p，q）定义为

N（p，q）= ∑n = 0至q Tn * pn，其中Tn由以下随机数生成器生成：

S0 = 290797 Sn + 1 = Sn2 mod 50515093 Tn = Sn mod p

令Nfac（p，q）为N（p，q）的阶乘。令NF（p，q）为Nfac（p，q）中因子p的数量。

给出NF（3,10000）mod 320 = 624955285。

求NF（61,107）mod 6110

--hints--

euler288()应该返回605857431263982000。

assert.strictEqual(euler288(), 605857431263982000);

--seed--

--seed-contents--

function euler288() {

  return true;
}

euler288();

--solutions--

// solution required

804 B Raw Blame History Unescape Escape