1015 Reversible Primes (20分)

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

题意：如果 n 是素数，且在 d 进制下反转后的数在十进制下也是素数，就输出 Yes，否则输出 No；有多组测试数据，输入负数时停止；

思路：判断输入是否为负数，判断 n 是否为素数，把 n 转换为d进制再反过来转换为 10 进制，判断是否为素数

c++代码 

#include<iostream>
#include<cmath>
using namespace std;
int isprime(int n){
	if(n < 2){
		return 0;
	}
	for(int i = 2; i <= sqrt(n); i++){
		if(n%i == 0){
			return 0;
		}
	}
	return 1;
}
int main(){
	int n, d;
	while(true){
		cin >> n >> d;
		if(n < 0){
			break;
		}
		if(!isprime(n)){
			cout << "No" << endl;
			continue;
		}
		int len = 0, sum = 0;
		int a[1000];
		while(n>0){
			a[len++] = n%d;
			n /= d;
		}
		for(int i = 0; i < len; i++){
			sum = sum*d + a[i];
		}
		if(isprime(sum)){
			cout << "Yes" << endl;
		}
		else{
			cout << "No" << endl;
		}
	}
	return 0;
}

 Python代码

import math
def check(num):
if num <= 1:
return 0
flag = 1
for x in range(2, round(math.sqrt(num))+1):
if num % x ==0:
flag = 0
return flag
return flag
def change(num, radix):
result = ''
while(num !=0):
temp = num % radix
result = str(temp) + result
num = num //radix
return result
if __name__ == "__main__":
while(True):
line = input().split(" ")
if len(line) < 2:
break
num = int(line[0])
radix = int(line[1])
if check(num) == 1:
rever = change(num, radix)
rever = rever[::-1]
rever = int(rever, radix)
if check(rever) == 1:
print("Yes")
else:
print("No")
else:
print("No")