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
一开始没明白题目什么意思。。。
应该是先输入一个十进制的数,然后输入一个基数,将该数转换成该进制之后,再reverse,然后再将reverse之后的某进制数转换回十进制,再判断是不是素数。
注意reverse之前的十进制数也必须是素数才能输出yes。
#include <iostream>
#include <string>
#include <cmath>
#include <stdlib.h>
#include <algorithm>
using namespace std;
bool isPrime(int x) {
if (x == 0 || x == 1) {
return false;
}
for (int i = 2; i <= sqrt(x); i++) {
if (x % i == 0) {
return false;
}
}
return true;
}
int main() {
int n, d;
while (true) {
cin >> n;
int c = n;
if (n < 0) {
break;
}
cin >> d;
string s = "";
while (n) {
s += n % d + '0';
n /= d;
}
int a = 0;
for (int i = 0; i < s.size(); i++) {
a *= d;
a += s[i] - '0';
}
if (isPrime(c) && isPrime(a)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
return 0;
}