1015 Reversible Primes (20 point(s)) - C语言 PAT 甲级

1015 Reversible Primes (20 point(s))

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

题目大意：

一个数 N，自身是素数，且在 D 进制下反转后也是素数，输出 Yes，否则 No

设计思路：

• 判断数本身，判断反转数，输出

编译器：C (gcc)

#include <stdio.h>

int isprime(int n)
{
        int i;
        if (n == 0 || n == 1)
                return 0;
        for (i = 2; i * i <= n; i++)
                if (n % i == 0)
                        return 0;
        return 1;
}

int rev(int n, int d)
{
        int nrev = 0;
        while (n) {
                nrev *= d;
                nrev += n % d;
                n /= d;
        }
        return nrev;
}

int main(void)
{
        int n, d;

        while (scanf("%d %d", &n, &d) == 2)
                puts(isprime(n) && isprime(rev(n, d)) ? "Yes" : "No");

        return 0;
}