def turn(n,m):
ans=""
while n>0:
ans=ans+str(n%m)
n//=m
return ans
def find_primes():
global primes
primes[0]=0;primes[1]=0
for i in range(2,N):
if primes[i]:
for j in range(2*i,N,i):
primes[j]=0
N=100005
primes=[1]*N
find_primes()
while True:
l=input().split()
if len(l)==1:
break
n,m=map(int,l)
ans=turn(n,m)
if primes[n] and primes[int(ans,m)]:
print("Yes")
else:
print("No")
PAT 甲级 1015 #python
最新推荐文章于 2025-06-13 10:25:00 发布