1015 Reversible Primes (20)（20 分）

1015 Reversible Primes (20)（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<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<map>
using namespace std;
int pri[100005];
void init()
{
	pri[1]=1;//表示不是质数 
	for(int i=2;i<=100000;i++)
	{
		if(pri[i]==0)
		{
			for(int j=i*2;j<=100000;j+=i)
				pri[j]=1;
		}
	}
	return ;
}
int main()
{
	init();
	int n,x;
	while(scanf("%d",&n)!=EOF)
	{
		if(n<0) return 0;
		scanf("%d",&x);
		if(n==0)printf("No\n");
		else 
		{
			if(pri[n])printf("No\n");
			else 
			{
				string s;
				int hh=1;
				while(hh<=n)hh=hh*x; //求出最大的那个是多少
				hh=hh/x;//表示最大的那个可能是多少啊
				while(n!=0)
				{
					int t=n/hh;
					s+=t+'0';
					n=n-t*hh;
					hh=hh/x;
				}
			//	cout<<s<<endl;
				reverse(s.begin(),s.end());
			//	cout<<s<<endl;
				int sum=0,kk=1;
				for(int i=s.size()-1;i>=0;i--)
				{
					sum+=(s.at(i)-'0')*kk;
					kk*=x;
				}
				if(pri[sum])printf("No\n");
				else printf("Yes\n");
			}	
		}	
	}
	return 0 ;
}