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

---

判断一个数num是否是素数，并且按照一个基数倒转过来是否是素数。通过num2=num2*radix+num%radix和num/=radix即可得到倒转过来的数num2，然后判断num1（等于原本的num值）和num2是否都为素数即可。

代码：

#include <iostream>
#include <cstring>
#include <vector>
#include <cstdlib>
#include <cstdio>
#include <cmath>
using namespace std;

bool isprime(long long num)
{
	if(num<=1) return false;
	long long k=sqrt(num);
	for(int i=2;i<=k;i++)
	{
		if(num%i==0) return false;
	}
	return true;
}

int main()
{
	while(true)
	{
		long long num,radix;
		cin>>num;
		if(num<0) break;
		cin>>radix;
		long long num1=num,num2=0;
		while(num>0)
		{
			num2=num2*radix+num%radix;
			num/=radix;
		}
		if(isprime(num1)&&isprime(num2)) cout<<"Yes"<<endl;
		else cout<<"No"<<endl;
	}
}