#include <iostream>
bool isprime(int n)
{
if (n <= 1)
return false;
else if (n == 2)
return true;
else {
for (int i = 2; i*i < n; i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
}
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
for (int i = a; i <= b; i++) {
int temp = i;
cout << i << "=";
int flag = 0;
while (temp != 1) {
for (int j = 2; j <= temp; j++) {
if (isprime(j) && temp % j == 0) {
temp = temp / j;
if(flag == 1)
cout << "*";
cout << j;
flag = 1;
break;
}
}
}
cout << endl;
}
return 0;
}
16.分解质因数
最新推荐文章于 2020-04-04 00:05:34 发布