32 lines
727 B
C++
32 lines
727 B
C++
|
#include <bits/stdc++.h>
|
||
|
|
|
||
|
|
using namespace std;
|
||
|
|
|
||
|
|
//判断是不是质数
|
||
|
|
bool isPrime(int n) { //最快的方法
|
||
|
|
if (n < 2) return false;
|
||
|
|
if (n == 2 || n == 3) return true;
|
||
|
|
if (n % 6 != 1 && n % 6 != 5) return false;
|
||
|
|
for (int i = 5; i <= floor(sqrt(n)); i += 6)
|
||
|
|
if (n % i == 0 || n % (i + 2) == 0)
|
||
|
|
return false;
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
int main() {
|
||
|
|
int m, n;
|
||
|
|
cin >> m >> n;
|
||
|
|
for (int i = m; i <= n; ++i) {
|
||
|
|
int maxZhiShu = INT32_MIN;
|
||
|
|
for (int j = i; j >= 2; j--) {
|
||
|
|
if (isPrime(j) && i % j == 0 && j > maxZhiShu) {
|
||
|
|
maxZhiShu = j;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
cout << maxZhiShu << " ";
|
||
|
|
}
|
||
|
|
|
||
|
|
return 0;
|
||
|
|
}
|