freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-231-the-prime-factorisation-of-binomial-coefficients.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

690 B
Raw Blame History

id, title, challengeType, videoUrl, dashedName
id title challengeType videoUrl dashedName
5900f4531000cf542c50ff66 问题231二项式系数的素因子化 5 problem-231-the-prime-factorisation-of-binomial-coefficients

--description--

二项式系数10C3 = 120. 120 = 23×3×5 = 2×2×2×3×5并且2 + 2 + 2 + 3 + 5 = 14.因此素数因子分解中的项的总和为10C3是14岁。

找出素数因子分解中的术语总和为20000000C15000000。

--hints--

euler231()应该返回7526965179680。

assert.strictEqual(euler231(), 7526965179680);

--seed--

--seed-contents--

function euler231() {

  return true;
}

euler231();

--solutions--

// solution required