题目:
解题思路:
1.1要特殊处理
2.对于大于等于2的数只要在求因子的过程中从小到大求,且每次找到一个因子就把原数除掉这个因子,这样找到的因子一定全是质因子,不需要判断是否为质数
代码:
#include <iostream>
#include <vector>
using namespace std;
int main()
{
long long num;
long long i;
long long factor, cnt;
int flag = 0;
cin >> num;
cout << num << "=";
if (num == 1)
cout << num;
else
{
for (i = 2; i <= num; i++)
{
if (num%i == 0)
{
factor = i;
cnt = 0;
while (num%i == 0)
{
num /= i;
cnt++;
}
if (flag == 0)
flag = 1;
else
cout << "*";
if (cnt == 1)
cout << i;
else
cout << i << "^" << cnt;
}
}
}
cout << endl;
return 0;
}