humble数的定义：humber = pow(2, a1) * pow(3, a2) * pow(5, a3) * pow(7, a4); 其中 a1, a2, a3, a4均为非负整数，且不全为0; 打印前20个平凡数的程序为：
#include<iostream>
using namespace std;
bool isHumbleNumber(int number)
{
while(number % 2 == 0)
number /= 2;
while(number % 3 == 0)
number /= 3;
while(number % 5 == 0)
number /= 5;
while(number % 7 == 0)
number /= 7;
if(number == 1)
return true;
return false;
}
void print()
{
int i = 2, total = 0;
while(total <= 20)
{
if(isHumbleNumber(i))
{
cout << i << " ";
total++;
}
i++;
}
}
int main()
{
print();
cout << endl;
return 0;
}
程序结果：
2 3 4 5 6 7 8 9 10 12 14 15 16 18 20 21 24 25 27 28 30