HDOJ 2098 分拆素数和

import java.util.Scanner;

public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (sc.hasNext()) {
int n =sc.nextInt();
if (n==0) {
break;
}
int count = 0;
boolean[] boo = Prime(n);
for (int i = 2; i < boo.length/2; i++) {
if (boo[i]&&boo[n-i]) {
count++;
}
}
System.out.println(count);
}
}
public static boolean[] Prime(int m){
boolean[] boo = new boolean[m];
for (int i = 2; i < boo.length; i++) {
boo[i] = true;
}
for (int i = 2; i < boo.length; i++) {
if (boo[i]) {
for (int j = i*2; j < boo.length; j+=i) {
boo[j]=false;
}
}
}
return boo;
}
}