PTA甲级 1015 Reversible Primes (C++)

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\le 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

Solution:

// Talk is cheap, show me the code
// Created by Misdirection 2021-08-11 21:30:13
// All rights reserved.

#include <iostream>
#include <vector>
#include <cmath>

using namespace std;

bool isPrime(long long& num){
    if(num == 1) return false;
    if(num == 3 || num == 2) return true;
    long long factor = 2;

    while(factor <= num / factor){
        if(num % factor == 0) return false;
        factor++;
    }
    
    return true;
}

int main(){
    long long n, reversedN;
    int d;
    cin >> n;

    while(n >= 0){
        scanf("%d", &d);
        // 首先判断 n 是不是一个素数
        if(!isPrime(n)){
            cout << "No" << endl;
            cin >> n;
            continue;
        }

        // 到这里说明 n 是一个素数，接下来找到 n 的 d 进制下的 reverse，判断他是不是素数
        // 先找到 n 在 d 进制下的表示

        string dRadixOfN = "";
        reversedN = 0;

        while(n != 0){
            int yushu = n % d;
            int shang = n / d;

            dRadixOfN = (char)(yushu + '0') + dRadixOfN;

            n = shang;
        }

        for(int i = dRadixOfN.length() - 1; i >= 0; --i) reversedN += (long long)(dRadixOfN[i] - '0') * pow(d, i);
        // cout << reversedN << endl;
        
        if(isPrime(reversedN)) cout << "Yes" << endl;
        else cout << "No" << endl;

        cin >> n;
    }

    return 0;
}