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<vector>
#include<cmath>
using namespace std;

bool isPrime(int num)
{
	if (num == 2 || num == 3)
		return true;
	if (num % 2 == 0)
		return false;
	for (int i = 3; i < sqrt(num); i = i + 2)
	{
		if (num % i == 0)
			return false;
	}
	return true;
}

int main()
{
	int radix, num;
	vector<int>vecRev;
	vector<bool>vecRes;
	bool flag = false;
	while (true)
	{
		scanf("%d", &num);
		if (num < 0)
			break;
		vecRev.clear();
		scanf("%d",&radix);
		flag = isPrime(num);
		if (!flag)
		{
			vecRes.push_back(flag);
			continue;
		}
		while (num != 0)
		{
			int temp = num % radix;
			num /= radix;
			vecRev.push_back(temp);
		}
		int reverse = 0;
		for (int i = 0; i < vecRev.size(); ++i)
			reverse += vecRev[i] * pow(radix, vecRev.size() - 1 - i);
		flag = isPrime(reverse);
		if (!flag)
		{
			vecRes.push_back(flag);
			continue;
		}
		vecRes.push_back(flag);
	}

	for (int i = 0; i < vecRes.size(); ++i)
	{
		if (vecRes[i])
			printf("%s\n", "Yes");
		else
			printf("%s\n","No");
	}
	return 0;
}