PAT Advanced 1015 Reversible Primes

1015 Reversible Primes

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 (<105) 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

题目大意

给定 一个数 转化为 k进制后，取反向转化为10进制后， 问是否是 质数， 如果是输出 Yes, 否则为 No

解题代码

#include <cstdio>
using namespace std;
int a[100010];
bool is_prime(int x){
    if (x < 2 ) return false;
    for (int i = 2; i <= x / i; i++)
        if (x % i == 0) return false;
    return true;
}
int main(){
    int n, d;
    while(scanf("%d %d", &n, &d) && n > 0){
        if (!is_prime(n)) {puts("No"); continue;}
        int sum = 0, len = 0, k = 1;
        while(n > 0){
            a[len ++] = n % d;
            n /= d;
        }
        for (int i = len - 1; i >= 0; i --){
            sum += a[i] * k;
            k *= d;
        }
        printf("%s\n", is_prime(sum) ? "Yes" : "No");
    }
    return 0;
}

改进 ：

转化对应的进制时，使用反向相乘 + 余数的形式

#include <cstdio>
using namespace std;
int a[100010];
bool is_prime(int x){
    if (x < 2 ) return false;
    for (int i = 2; i <= x / i; i++)
        if (x % i == 0) return false;
    return true;
}
int main(){
    int n, d;
    while(scanf("%d %d", &n, &d) && n > 0){
        if (!is_prime(n)) {puts("No"); continue;}
        int sum = 0, len = 0, k = 1;
        while(n > 0){
            a[len ++] = n % d;
            n /= d;
        }
        for (int i = 0; i < len; i++) n = n * d + a[i];
        printf("%s\n", is_prime(n) ? "Yes" : "No");
    }
    return 0;
}