1015 Reversible Primes

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​5​​) 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<bits/stdc++.h>
using namespace std;

#define e exp(1)
#define pi acos(-1)
#define mod 1000000007
#define inf 0x3f3f3f3f
#define ll long long
#define ull unsigned long long
#define mem(a,b) memset(a,b,sizeof(a))
int gcd(int a,int b){return b?gcd(b,a%b):a;}

int isPrime(int x)
{
	if(x==0||x==1)return 0;
	else 
	{
		for(int i=2; i<=sqrt((double)x); i++)
		{
			if(x%i==0)return 0;
		}
		return 1;
	}
}
int rePrime(int n,int k)
{
	int sum=0;
	while(n)
	{
		sum=sum*k+n%k;
		n/=k;
	}
	return sum;
}
int main()
{
	int n,k;
	while(~scanf("%d",&n))
	{
		if(n<0)break;
		scanf("%d",&k);
		if(isPrime(n)&&isPrime(rePrime(n,k)))
		puts("Yes");
		else puts("No");
	}
	return 0;
}