PTA-1015——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 (<) and D (1), 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

分析:

进制转换，一个注意点：1不是素数，不然会卡在第二个测试点

代码:

 1 #include<iostream>
 2 #include<cmath>
 3 using namespace std;
 4 long long x;
 5 int n,d;
 6 bool judge(long long x){    //判断是否为素数 
 7     int i;
 8     for(i=2;i<=sqrt(x);i++){
 9         if(x%i==0){
10             break;
11         }
12     }
13     if(i>sqrt(x)&&x>=2){
14         return true;
15     }else{
16         return false;
17     }
18 }
19 int main(){
20     while(cin>>n&&n>=0){
21         cin>>d;
22         x=0;
23         if(!judge(n)){
24             cout<<"No"<<endl;
25         }else{
26             while(n){    //转进制 
27                 x=x*10+n%d;
28                 n/=d;
29             }
30             int m=0;
31             int t=1;
32             while(x){    //转回10进制 
33                 m+=x%10*t;
34                 t*=d;
35                 x/=10;
36             }
37             if(!judge(m)){
38                 cout<<"No"<<endl;
39             }else{
40                 cout<<"Yes"<<endl;
41             }
42         }
43     }
44     return 0;
45 } 

 

转载于:https://www.cnblogs.com/orangecyh/p/10307373.html