查找组成一个偶数最接近的两个素数
查找组成一个偶数最接近的两个素数
http://www.nowcoder.com/questionTerminal/f8538f9ae3f1484fb137789dec6eedb9
import java.util.*;
public class Main {
public Main() {
}
private boolean isPrime(int num) {
for (int i = 2; i <= num/i; i++) {
if (num % i == 0) return false;
}
return true;
}
public int count(int n) {
int i = n/2, j = n - i;
while (!isPrime(i) || !isPrime(j)) {
i++;
j--;
}
return j;
}
public static void main(String[] args) {
Main solution = new Main();
Scanner in = new Scanner(System.in);
while (in.hasNext()) {
int n = Integer.parseInt(in.next());
int res = solution.count(n);
System.out.println(res);
System.out.println(n - res);
}
}
}
查看15道真题和解析