Information
- ID
- 44
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 7
- Tags
- # Submissions
- 1032
- Accepted
- 249
- Uploaded By
有一个小小的注意点,先从小的除,防止超时
#include <iostream>
#include <cmath>
using namespace std;
int isprime(int n)
{
int m = sqrt(n);
for(int i = 2; i <= m; i++)
{
if(n % i == 0) return 0;
}
return 1;
}
int main()
{
int n = 0;
cin >> n;
int m = sqrt(n);
int i = 0;
for(i = 2; i <= m; i++)
{
if(n % i == 0 && isprime(n/i))
{
cout << n/i << endl;
break;
}
}
return 0;
}
By signing up a 追梦算法网 universal account, you can submit code and join discussions in all online judging services provided by us.