1015. Reversible Primes (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⁵) 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
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;

bool isPrime(int val)
{
	if (val < 2)
		return false;
	int mid = sqrt(val * 1.0);
	for (int i = 2; i <= mid; ++i)
	{
		if (val % i == 0)
			return false;
	}
	return true;
}
bool getElement(int n, int d)
{
	if (!isPrime(n))
		return false;
	int other = 0;
	while (n)
	{
		other = other * d + n % d;
		n /= d;
	}
	return isPrime(other);

}
int main(void)
{
	int n, d, a, b;//n为数值，d为进制
	while (scanf("%d%d", &n, &d))
	{
		if (n < 0)
			break;
		if (getElement(n,d))
			printf("Yes\n");
		else
			printf("No\n");
	}
}