PAT 甲 1015 Reversible Primes

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

注意1不是素数！

#include<iostream>
#include<stdio.h>
#include<math.h>
using namespace std;

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

int main(){
	int n,r,m,nn;
	int a[1000]={0};
	do{
		cin>>n;
		if (n<0) return 0;
		cin>>r;
		int x=0,y,k;
		nn=n;
		while (n>0){
			a[x++]=n%r;
			n=n/r;
		}
		k=1;
		m=0;
		for (int i=x-1;i>=0;i--){
			m+=a[i]*k;
			k=k*r;
		}
		if (Isprime(nn)&&Isprime(m)) cout<<"Yes"<<endl;
		else cout<<"No"<<endl;
		
	}while(nn>0);
	
	return 0;
}

欢迎指导和交流！