PAT (Advanced Level)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<stdio.h>
#include<math.h>

const int maxn=10005;

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

int invert(int n,int d){
	int res=0,s[maxn],i=0;
	do{
		s[i++]=n%d;
		n/=d;
		//printf("%d ",s[i-1]);
	}while(n);
	for(int j=0;j<i;j++)
		res=res*d+s[j];
	return res;
}

int main(){
	int n,d,result[maxn],count=0;
	while(scanf("%d",&n)!=EOF&&n>=0){
		scanf("%d",&d);
		//printf("\n%d\n",invert(n,d));
		result[count]=isprime(n)&&isprime(invert(n,d));
		printf("%s\n",result[count++]?"Yes":"No");
	}
	return 0;
}