H.java 876 B

1234567891011121314151617181920212223242526272829303132
  1. import java.io.PrintWriter;
  2. import java.util.Arrays;
  3. import java.util.Scanner;
  4. public class H {
  5. static Scanner cin = new Scanner(System.in);
  6. static PrintWriter cout = new PrintWriter(System.out);
  7. static boolean[] prime = new boolean[1000000 + 5];
  8. static {
  9. Arrays.fill(prime, true);
  10. prime[0] = prime[1] = false;
  11. for (int i = 2; i * i <= prime.length; i++)
  12. if (prime[i])
  13. for (int j = i * i; j < prime.length; j += i) prime[j] = false;
  14. }
  15. public static void main(String[] args) {
  16. while (cin.hasNext()) {
  17. int n = cin.nextInt();
  18. int tot = 0;
  19. for (int i = 3; i <= n / 2; i += 2) {
  20. if (prime[i] && prime[n - i])
  21. ++tot;
  22. }
  23. cout.println(tot);
  24. }
  25. cin.close();
  26. cout.close();
  27. }
  28. }