【PAT】1015. Reversible Primes (20)

题目

---

链接： https://www.patest.cn/contests/pat-a-practise/1015

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

分析

---

在进制数D下的 整数N 和 其反向数 是否均为 质数

（1） 十进制转化为其他进制

void convertIntoDRedix(int n, int d) {
    int temp = 0;
    while (n){
        temp = n % d;
        n /= d;
        if (temp <= 9) {
            reverse_Q.push(temp + '0');
        } else {
            reverse_Q.push(temp - 10 + 'A');
        }
    }
}

（2） 其他进制转化为十进制

int toInteger(int d) {
    int num = 0;
    int t = 0;
    char tempChar;

    while (!reverse_Q.empty()) {

        tempChar = reverse_Q.front();
        reverse_Q.pop();

        if (tempChar >= '0'&& tempChar <= '9'){
            t = tempChar - '0';
        } else {
            t = tempChar - 'A' + 10;
        }

        num = num * d + t;
    }
    return num;
}

（3） 判断是否为质数

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

题解（已AC）

---

/**
    2018.1.25
    Donald
*/
//1015. Reversible Primes (20)

/**
    input : 整数N  进制数 D
    output: Yes or No

    在进制数D下的整数N 和 其反向数 是否均为质数
*/


#include<cstdio>
#include<queue>
#include <iostream>
using namespace std;

int N, D;
int reverse_N;
queue<char> reverse_Q;

void convertIntoDRedix(int n, int d) {
    int temp = 0;
    while (n){
        temp = n % d;
        n /= d;
        if (temp <= 9) {
            reverse_Q.push(temp + '0');
        } else {
            reverse_Q.push(temp - 10 + 'A');
        }
    }
}

int toInteger(int d) {
    int num = 0;
    int t = 0;
    char tempChar;

    while (!reverse_Q.empty()) {

        tempChar = reverse_Q.front();
        reverse_Q.pop();

        if (tempChar >= '0'&& tempChar <= '9'){
            t = tempChar - '0';
        } else {
            t = tempChar - 'A' + 10;
        }

        num = num * d + t;
    }
    return num;
}

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

int main(void) {

    while (scanf("%d", &N) == 1) {
        if (N < 0) {
            break;
        }

        scanf("%d", &D);

        convertIntoDRedix(N, D);

        reverse_N = toInteger(D);

        if (isPrime(N) && isPrime(reverse_N)) {
            puts("Yes");
        } else {
            puts("No");
        }
    }

    return 0;
}