1015 Reversible Primes (20分)

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

#include <iostream>
#include <algorithm>
#include<vector>
#include<map>
#include<string>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<unordered_map>
#include<queue>
#include<climits>
using namespace std;
const int maxn= 1000+5;
bool isprime(int n){
	if(n==1) return false;
	for(int i=2;i*i<=n;i++){
		if(n%i==0) return false;
		
	}
	return true;
}


bool check(int n,int d){
	if(!isprime(n)) return false ;
	long long r=0;
	while(n){
		r=r*d+n%d;	
		n/=d;
	}
	
	
	
	return isprime(r);
}


int main(){
	int n;
	int d;
	while(cin>>n>>d&&n>=1){
		if(check(n,d)) puts("Yes");
		else puts("No");
			
	}
 
	return 0;	
}