PTA(A)1015 Reversible Primes (20point(s))

思路：
判断原数字是不是质数，然后按照进制逆序后判断是不是质数。
代码：

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

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

int main()
{
    ll n, b;
    while (cin >> n)
    {
        if (n < 0) break;
        cin >> b;
        vector<int>v;

        int f1 = isPrime(n);

        while (n)
        {
            v.push_back(n % b);
            n /= b;
        }

        ll num = 0;

        for (int i = 0; i < v.size(); ++i)
        {
            // cout << v[i] << endl;
            num = num * b + v[i];
        }

        int f2 = isPrime(num);

        if (f1 == 1 && f2 == 1)
            cout << "Yes" << endl;
        else
            cout << "No" << endl;
    }

    return 0;
}