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⁵) 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 <math.h>
using namespace std;
bool isPrime(int n){
    if(n==0 || n==1){   //special case
        return false;
    }
    for(int i=2;i<=sqrt(n);i++){
        if(n%i==0){
            return false;
        }
    }
    return true;
}
int reverseValue(int n,int d){
    if(d==1){
        return n;
    }
    int temp[20],flag=0;
    while(n/d!=0 || n%d!=0){
        temp[flag++] = (n%d);
        n = n/d;
    }
    int sum = 0;
    for(int i=0;i<flag;i++){
        sum += temp[i]*pow(d,flag-1-i);
    }
    return sum;
}
int main()
{
    int N,D,reverseNum;
    cin>>N>>D;
    while(N>-1){
        if(!isPrime(N)){
            cout<<"No"<<endl;
        }else{
            reverseNum = reverseValue(N,D);
            if(isPrime(reverseNum)==true){
                cout<<"Yes"<<endl;
            }else{
                cout<<"No"<<endl;
            }
        }
        cin>>N;
        if(N<0){
            break;
        }
        cin>>D;
    }
    return 0;
}