PTA Reversible Primes

链接

https://pintia.cn/problem-sets/994805342720868352/problems/994805495863296000

题解

用模D正取余的方式实现进制转化+翻转

代码

def isprime(n):
    if n==1: return False
    i=2
    while(i*i<=n):
        if n%i==0:
            return False
        i=i+1
    return True

while True:
    lis=input().split()
    if int(lis[0])<0: break
    N,D = [int(x) for x in lis]
    flag = isprime(N)
    if flag:
        rev=0
        while N:
            rev=rev*D+N%D
            N//=D
        flag = flag and isprime(rev)
    if flag: print('Yes')
    else: print('No')