PAT(A) - 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 <cstdio>
#include <string>
#include <iostream>

using namespace std;

string num = "0123456789";

bool isPrime( int n ) {
    if( n == 0 || n == 1 ) return false;
    for( int i = 2; i < n; i++ ) {
        if( n % i == 0 ) return false;
    }
    return true;
}

int myPow( int n, int len, int d ) {
    int ans = n;
    for( int i = 0; i < len; i++ ) {
        ans = ans * d;
    }
    return ans;
}
bool fun( int n, int d ) {
    string ans = "";
    int a = n;
    while( n ) {
        ans = ans + num[n % d];
        n = n / d;
    }

    int b = 0;
    int size = ans.size();
    for( int i = 0; i < size; i++ ) {
        b = b + myPow( ans[i] - '0', size - 1 - i, d );
    }
    if( isPrime( a ) && isPrime( b ) ) {
        return true;
    }
    else return false;
}
int main() {
    int n, d;
    while( 1 ) {
        scanf( "%d", &n );
        if( n < 0 ) break;
        scanf( "%d", &d );
        if( fun( n, d ) ) {
            printf( "Yes\n" );
        }
        else printf( "No\n" );
    }
    return 0;
}