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
代码:
#include <bits/stdc++.h>
using namespace std;
bool isPrime(int num){
if(num == 1)return false;
for(int i=2 ; i<=sqrt(num) ; ++i){
if(num%i == 0)return false;
}
return true;
}
int getRev(int num,int rad){
stack<int> st;
while(num){
st.push(num%rad);
num /= rad;
}
int com = 1,re = 0;
while(!st.empty()){
re += st.top()*com;
st.pop();
com *= rad;
}
return re;
}
int main(){
int N,D;
while(scanf("%d",&N) && N>=0){
scanf("%d",&D);
if(!isPrime(N))printf("No\n");
else {
if(isPrime(getRev(N,D)))printf("Yes\n");
else printf("No\n");
}
}
return 0;
}