1015 Reversible Primes (20 分)
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
分析:
两个函数一个是isprime素数判断函数,另一个是转换函数,我这里用栈来临时存储了,然后在进行逐位转10进制,最后判断是否是素数即可
代码
#include<bits/stdc++.h>
using namespace std;
bool is_prime(int n){
if(n<=1) return false;
int sqr=(int)sqrt(1.0*n);
for(int i=2;i<=sqr;i++){
if(n%i==0){
return false;
}
}
return true;
}
int change(int a,int b){
stack<int> s;
while(a!=0){
int tmp=a%b;
s.push(tmp);
a/=b;
}
int sum=0;int k=0;
while(!s.empty()){
sum+=s.top()*pow(b,k);
k++;
s.pop();
}
return sum;
}
int main(){
int a,b;
while(cin>>a){
if(a<0) break;
cin>>b;
int tmp=change(a,b);
if(is_prime(a)&&is_prime(tmp)){
printf("Yes\n");
}
else printf("No\n");
}
}