1015 Reversible Primes (20 分) PAT 甲级 一定要读懂题意

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

题意：如果n（10进制）是质数，且d进制下的n的逆序也是质数，就yes，否则no

#include<iostream>
#include<cmath>
using namespace std;
#define range 10002
int a[range];
int to_other_radix(int n,int d)
{
	int i=0;
	while(n!=0)
	{
		a[i++]=n%d;
		n/=d;
	}
	return i;
}
int to_dec(int len,int d)
{
	int sum=0;
	for(int i=0;i<len;i++)
	{
		sum+=a[i]*pow(d,len-1-i);
	}
	return sum;
}
bool IsPrime(int t)
{
	if(t<=1)
	return false;
	int d=1.0*sqrt(t);
	for(int i=2;i<=d;i++)
	if(t%i==0)
	return false;
	return true;
}
int main()
{
	
	int n,d,i,t,len=0;
	while(cin>>n)
	{
		if(n<0)
		break;
		cin>>d;
		if(!IsPrime(n))
		{
			cout<<"No"<<endl;
			continue;
		}
		
		len=to_other_radix(n,d);
		t=to_dec(len,d);
		if(IsPrime(t))
		cout<<"Yes"<<endl;
		else
		cout<<"No"<<endl;
	}
	return 0;
 }