「1015」Reversible Primes

➳ENTRY

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 and (1< ≤10), you are supposed to tell if is a reversible prime with radix .

Input Specification:

The input file consists of several test cases. Each case occupies a line which contains two integers and . The input is finished by a negative .

Output Specification:

For each test case, print in one line Yes if is a reversible prime with radix , or No if not.

Sample Input:

73 10
23 2
23 10
-2

Sample Output:

Yes
Yes
No

---

Ω

极简翻译：给出好几组数，一组一行。一组数包含一个十进制数 和一个进制数 ，如果 是一个素数且在 进制下的反转数也是素数，那么便输出Yes，反之输出No。最后以一个负数表示结束。

《日常水文章系列》

⚠️本题唯一需要注意的地方是判断素数一定要考虑1。

对于在 进制下求 的十进制反转数，由于 出来的依次是反转数的最高位到最低位，因此用一个循环即可：

int rn=0;
    while(n>0)
    {
      rn=rn*d+n%d;
      n/=d;
    }

---

C☺DE

#include <iostream>
#include <cmath>

using namespace std;

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

int main()
{
    int n, d;
    cin >> n;
    while (n > 0)
    {
        cin >> d;
        if (!isPrime(n))
            cout << "No" << endl;
        else
        {
            int rn = 0;
            while (n > 0)
            {
                rn = rn * d + n % d;
                n /= d;
            }
            cout << (isPrime(rn) ? "Yes" : "No") << endl;
        }
        cin >> n;
    }
}