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
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
char a[50],b[50];
bool isPrime(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;
}
//void get_reverse(void){
// int len=strlen(a);
// int i;
// for(i=0;i<len;i++){
// b[i]=a[len-1-i];
// }
// b[i]='\0';
//}
int main(){
int N,D;
while(scanf("%d %d",&N,&D)){
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
if(N<0) break;
int num=N;
int i=0;
do{
a[i++]=N%D;
N/=D;
}while(N);//避免0的情况 0的时候长度为1
// printf("%d",(int)pow(N,1/2));
// printf("%d\n",strlen(a));
// while(N){
// a[i++]=N%D;
// N/=D;
// }
// get_reverse();
int num2=0;
for(int j=0;j<i;j++){
num2=num2*D+a[j];
// num2+=pow(D,j)*b[j];
}
// printf("%d\n",num2);
if(isPrime(num)&&isPrime(num2)) printf("Yes\n");
else printf("No\n");
}
return 0;
}