1015 Reversible Primes (20)（JAVA）

1015 Reversible Primes (20)（20 分）

A reversible prime in any number system is a prime whose “reverse” in that number system is also a prime. For example in the decimal system 73 is a reversible prime because its reverse 37 is also a prime.

Now given any two positive integers N (< 10^5^) and D (1 < D <= 10), you are supposed to tell if N is a reversible prime with radix D.

Input Specification:

The input file consists of several test cases. Each case occupies a line which contains two integers N and D. The input is finished by a negative N.

Output Specification:

For each test case, print in one line “Yes” if N is a reversible prime with radix D, or “No” if not.

Sample Input:

73 10
23 2
23 10
-2

Sample Output:

Yes
Yes
No

作者: CHEN, Yue
单位: PAT联盟
时间限制: 400 ms
内存限制: 64 MB
代码长度限制: 16 KB

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        while(n >= 0) {
            int m = sc.nextInt();
            boolean IsPrime = true;
            for(int i = 2; i <= Math.sqrt(n); i++) {
                if(n % i == 0) {
                    IsPrime = false;
                }
            }
            String s = Integer.toString(n,m);
            StringBuilder st = new StringBuilder(s);
            s = st.reverse().toString();
            int a = Integer.valueOf(s,m);
            if(a == 1 || a == 0) {
                IsPrime = false;
            }
            for(int i = 2; i <= Math.sqrt(a); i++) {
                if(a % i == 0) {
                    IsPrime = false;
                }
            }
            if(IsPrime) {
                System.out.println("Yes");
            }else {
                System.out.println("No");
            }
            n = sc.nextInt();
        }
    }
}