ZOJ---1015. Reversible Primes (20)_java 1015. reversible primes (20)-CSDN博客

本文介绍了一种判断可逆素数的方法，即一个数在指定进制下为素数且其反转数也是素数的问题。文章详细解释了如何将一个十进制数转换为任意进制数，并给出了通过反转该进制数再转换回十进制来判断是否为素数的算法。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目描述

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进制下反转后的数在十进制下也是素数，就输出Yes，否则就输出No。

关键点：
1. 一个数10进制转换成d进制：考虑用一个105长的vector存每位值，纪录最高位；
3. 反转：从最低位开始计算和，直到记录的最高位，求和就是在转换成10进制；
3. 判断素数：…

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cmath>
#include <vector>

using namespace std;

bool is_prime(int n)
{   
    if (n <= 1)
        return false;
    int sqr = int(sqrt(n*1.0));
    for (int i = 2; i <= sqr; ++i)
        if (n%i == 0)
            return false;
    return true;
}
//输出radix进制下反转后的十进制值
int invert(int n, int radix)
{
    vector<int> res(105, 0);
    int high, tmp, val=0;
    high = int(log(n) / log(radix));
    tmp = high;
    while (n != 0){
        res[tmp] = n / int(pow(radix, tmp));
        n -= int(pow(radix, tmp))*res[tmp];
        tmp = int(log(n) / log(radix));
    }
    tmp = 0;
    while (tmp <= high){
        val += res[tmp] * int(pow(radix, high - tmp));
        ++tmp;
    }
    return val;
}
int main()
{
    int n, d;
    while (scanf("%d", &n) != EOF){
        if (n < 0) break;
        scanf("%d", &d);
        if (!is_prime(n)){
            printf("No\n");
            continue;
        }
        printf("%s", is_prime(invert(n, d)) ? "Yes\n" : "No\n");//这种语句看起来很不错，可以减少代码量。
    }
    return 0;
}