freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.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

705 B
Raw Blame History

id, title, challengeType, videoUrl, dashedName
id title challengeType videoUrl dashedName
5900f4791000cf542c50ff8b 问题268计算至少有四个不同素因子小于100的数字 5 problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100

--description--

可以证实有23个小于1000的正整数可被至少四个小于100的不同质数整除。

找出少于1016的正整数可被至少四个小于100的不同质数整除。

--hints--

euler268()应该返回785478606870985。

assert.strictEqual(euler268(), 785478606870985);

--seed--

--seed-contents--

function euler268() {

  return true;
}

euler268();

--solutions--

// solution required