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 (<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
No

解题

1.质数（性质）：定义判断是否为质数的函数

判断指数的函数有很多，随便挑一个就是了

def isPrime(num):
    if num <= 1:
        return 0
    flag = 1
    for x in range(2, round(num**0.5)+1):
        if num % x ==0:
            flag = 0
            return flag
    return flag

2.翻转（核心）：根据不同进制翻转数字

主要考查数学功底

def reverse(num, radix):
    result = ''
    while(num !=0):
        temp = num % radix
        result = str(temp) + result
        num = num //radix
    return result

3.主题代码：利用函数完成题目

if __name__ == "__main__":
    while(True):
        line = input().split(" ")
        if len(line) < 2:
            break
        num = int(line[0])
        radix = int(line[1])
        if isPrime(num) == 1:
            rever = reverse(num, radix)
            rever = rever[::-1]
            rever = int(rever, radix)
            if isPrime(rever) == 1:
                print("Yes")
            else:
                print("No")
        else:
            print("No")