PAT (Advanced Level) Practice1015 Reversible Primes

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

题意：给出一些数字，遇到负数停止输入。若该数字与给出的进制基数的逆序的十进制都为素数，则输出yes，否则输出no。

思路：（1）0和1都不是素数。

           （2）判断素数时用sqrt来减小计算量 

             3.进制转换用上除基取余

#include <bits/stdc++.h>
using namespace std;
int n;
int radix;
int d[111];
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;
    }


int main(){
    while(scanf("%d",&n)!=EOF){
        if(n<0) break;
        scanf("%d",&radix);
        if(!isprime(n)){
            printf("No\n");
        }
        else{
            int len=0;
            do{
                d[len++]=n%radix;
                n/=radix;
            }while(n!=0);
            for(int i=0;i<len;i++){
                n=n*radix+d[i];
            }
            if(isprime(n)){
                printf("Yes\n");
            }else{
                printf("No\n");
            }
        }
}
}