PAT A1015 Reversible Primes (20分)

#include <cstdio>
#include <cmath>

bool isPrime(int n){
	if(n == 1) return false;
	int sqr = (int)sqrt(n*1.0);
	for(int i=2; i<=sqr; i++){
		if(n % i == 0) return false;
	}
	return true;	
}

int main(){
	int n, d;
	int num;
	while(scanf("%d %d", &n, &d)){
		if(n < 0) return 0;
		num = 0;
		int before = n;
		int t;
		int rev = 0;
		do{
			t = n % d;
			rev = rev*d + t;
			num++;
			n /= d;
		}while(n != 0);
		
		if(isPrime(before) && isPrime(rev)){
			printf("Yes\n");
		}else{
			printf("No\n");
		}
	}
	
	return 0;
}