---
title: Counting numbers with at least four distinct prime factors less than 100
localeTitle: 计算至少有四个不同质数因子小于100的数字
---
## 问题268：计算至少有四个不同素因子小于100的数字

这是一个存根。 [帮助我们的社区扩展它](https://github.com/freecodecamp/guides/tree/master/src/pages/certifications/coding-interview-prep/project-euler/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100/index.md) 。

[这种快速风格指南有助于确保您的拉取请求被接受](https://github.com/freecodecamp/guides/blob/master/README.md) 。