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

---
id: 5900f4791000cf542c50ff8b
challengeType: 5
videoUrl: ''
title: 问题268：计算至少有四个不同素因子小于100的数字
---

## Description
<section id="description">可以证实，有23个小于1000的正整数可被至少四个小于100的不同质数整除。 <p>找出少于1016的正整数可被至少四个小于100的不同质数整除。 </p></section>

## Instructions
<section id="instructions">
</section>

## Tests
<section id='tests'>

```yml
tests:
  - text: <code>euler268()</code>应该返回785478606870985。
    testString: assert.strictEqual(euler268(), 785478606870985);

```

</section>

## Challenge Seed
<section id='challengeSeed'>

<div id='js-seed'>

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

euler268();

```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```

/section>