#include<iostream>
#include<cmath>
bool isPrime(int x)
{
for (int i = 1;i <= (int)sqrt(x);i++)
{
if (x%i == 0 && i != 1)
return false;
}
return true;
}
using namespace std;
int main()
{
int m, n,flag=0;
cin >> m >> n;
for (int i = m;i <= n-1;i++)
{
flag = 0;
for (int j = i;j > 1;j--)
{
if (i%j == 0 && isPrime(j))
{
cout << j << ",";
flag = 1;
break;
}
}
if (!flag)
{
cout << i << ",";
}
}
flag = 0;
for (int j = n;j > 1;j--)
{
if (n%j == 0 && isPrime(j))
{
cout << j << endl;
flag = 1;
break;
}
}
if (!flag)
{
cout << n << endl;
}
return 0;
}
最大质因子序列OpenJudge1.13编程基础之综合应用-21
最新推荐文章于 2023-12-12 15:31:40 发布