【PAT】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 (<10​5​​) 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

题目大意

判断某数n以及在d进制下的反转数是否都为素数。

代码

#include <iostream>
#include <cstdio>
#include <cmath>
int isPrime(int n){
    if(n <= 1) return false;
    for(int i = 2, l = (int)sqrt(n); i <= l; i++){
        if(n % i == 0){
            return false;
        }
    }
    return true;
}
int main() {
    int n, d;
    while (scanf("%d", &n) != EOF) {
        if(n < 0) break;
        scanf("%d", &d);
        if(isPrime(n) == false){
            printf("No\n");
            continue;
        }
        int a[100], len = 0;
        do{
            a[len++] = n % d;
            n /= d;
        }while (n != 0);
        for(int i = 0; i < len; i++)
            n = n * d + a[i];
        printf(isPrime(n) ? "Yes\n" : "No\n");
    }
    return 0;
}