freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.chinese.md

id	challengeType	title	videoUrl	localeTitle
5900f4791000cf542c50ff8b	5	Problem 268: Counting numbers with at least four distinct prime factors less than 100		问题268：计算至少有四个不同素因子小于100的数字

Description

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

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

Instructions

Tests

tests:
  - text: <code>euler268()</code>应该返回785478606870985。
    testString: 'assert.strictEqual(euler268(), 785478606870985, "<code>euler268()</code> should return 785478606870985.");'

Challenge Seed

function euler268() {
  // Good luck!
  return true;
}

euler268();

Solution

// solution required