#include<iostream>
#include<cmath>
using namespace std;
bool sushu(long m)
{
for (long i = 2; i <= sqrt(m); i++)
{
if (m%i == 0)
return 0;
}
return 1;
}
int main()
{
long n;
while (cin >> n)
{
for (int i = 2; i <= n / 2; i++)
{
if (sushu(i) && n%i == 0)
if (sushu(n / i))
if (n / i > i)
{
cout << n / i << endl;
break;//不break的话会重复输出,例如21 会现有i=3然后n/i=7,然后i=7,n/i=3
}
else {
cout << i << endl;
break;
}
}
}
return 0;
}
1313 质因数分解
最新推荐文章于 2022-10-27 09:33:56 发布