1. 如何分解质因数,将一个数字的所有质因数都排列出来,如180,2 2 3 3 5
void pailieyinshu(long num)//将一个long的整数,分解成所有的质因数排列
{
int i = 0;
int k = 0;
for (i = 2; i <= num; i++)
{
if ( num%i == 0)
{
num = num / i;
cout << i << " ";
}
while (num%i == 0)//将其除尽为止
{
cout << i << " ";
num /= i;
}
}
cout << endl;
}