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

73 10
23 2
23 10
-2

结尾无空行

Sample Output:

Yes
Yes
No

结尾无空行

#include<iostream>
#include<cmath>
using namespace std;
bool isprime(int x){
	if(x<2)return false;
	for(int i=2;i*i<=x;i++){
		if(x%i==0)return false ;
	}
	return true;
}
int tranisprime(string s,int b)
{
	int base=1,sum=0;
	for(int i=s.length()-1;i>=0;i--)
	{
		sum+=int(s[i]-'0')*base;
		base*=b;
	}
	if(isprime(sum))return 1;
	return 0;
}
int main()
{
	int a,b,c,d;
	while(1)
	{
		cin>>a>>b;
		if(a<0)return 0;
		if(!isprime(a))cout<<"No\n";
		else {
			string s="";
			while(a){		//将数字用字符串的形式存储到s中 
				s=s+char('0'+a%b);
				a/=b;
			}
			if(tranisprime(s,b))cout<<"Yes\n";
			else cout<<"No\n";
		}
	}
}