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

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和d,判断n是不是素数，将n转化成d进制的数字n1，然后逆转n1，将n1转化成十进制的数字，判断是不是素数。

#include
#include
#include
using namespace std;
int prime[666666];
int tot=0;
int check[100005];
void init(){
	check[1]=1;
	check[0]=1;
	for(int i=2;i<=100000;i++){
		if(!check[i]) prime[tot++]=i;
		for(int j=0;j>n){
		if(n<0) break;
		else cin>>d;
		if(solve(n,d)) cout<<"Yes\n";
		else cout<<"No\n";
	}
	return 0;
}