pat 甲级素数进制转换 A1015 Reversible Primes (20分)

本文链接：https://blog.csdn.net/weixin_42358356/article/details/107551546

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 (<105) 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:

Sample Output:

Yes
Yes
No

题意：如果一个数本身是素数，而且在d进制下反转后的数在十进制下也是素数，就输出Yes，否则就输出No

#include<cstdio>
#include<cmath>
bool isPrime(int a)
{
	if(a<=1) return false;
	int sqr=(int)sqrt(1.0*a);
	for(int i=2;i<=sqr;i++)
	{
		if(a%i==0) return false;
	}
	return true;
}
int main()
{
	int n,d,ans[100010];
	while(scanf("%d",&n)!=0)
	{
		if(n<0) break;
	    scanf("%d",&d);
		if(isPrime(n)==false) 
		printf("No\n");
		else
		{
			int num=0;
			do{
				ans[num++]=n%d;
				n/=d;
			}while(n!=0);
			for(int i=0;i<num;i++)//转换为d进制 从小到大乘 即为按照d进制反转后的数
			{
				n=n*d+ans[i];
			}
			if(isPrime(n)==true)
			printf("Yes\n");
			else printf("No\n");
		}
	}
	return 0;
}