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
思路:
1.先判断原数字是不是素数
2.进制反转后的数是不是素数
注意点:
1.1不是素数
2.输入小于0时结束
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int d[100001];
bool isprime(int n) {
if (n <= 1)return false;
int t = int(sqrt(n*1.0));
for (int i = 2; i <= t; i++) {
if (n % i == 0)return false;
}
return true;
}
int main() {
int n, radix;
while (scanf("%d",&n) != EOF&& n >= 0) {
cin >> radix;
if (!isprime(n)) {
cout << "No" << endl;
}else{
//进制转换
int len = 0;
while (n != 0){
d[len++] = n % radix;
n /= radix;
}
//进制逆序
for (int i = 0; i < len; i++) {
n = n * radix + d[i];
}
if (isprime(n))cout << "Yes"<<endl;
else cout << "No"<<endl;
}
}
return 0;
}