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⁵) 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.

73 10
23 2
23 10
-2

Yes
Yes
No

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner in=new Scanner(System.in);
		int num,tmp,mun;
		int d;
		while((tmp=in.nextInt())>0){
			num=tmp;
			d=in.nextInt();
			mun=change(num,d);
			if(isprime(num)&&isprime(mun)){
				System.out.println("Yes");
			}else{
				System.out.println("No");
			}
		}

	}

	private static boolean isprime(double num) {
		if (num-2<0)return false;
		if(num==2) return true;
		for(int i=2;i<=Math.sqrt(num);i++){
			if(num%i==0){
				return false;
			}
		}
		return true;
	}

	private static int change(int num, int d) {
		int mun=0;
		while(num>=d){
			mun=mun*d+num%d;
			num=num/d;
		}
		mun=mun*d+num%d;
		return mun;
	}

}

　　参考

http://blog.csdn.net/apie_czx/article/details/45538361

感觉难得是把数倒过来，还有在判断素数的时候，i<=sqrt()的等于号不能漏