[PAT (Advanced Level) ]1015. Reversible Primes 解题文档

1015. Reversible Primes (20)

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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 (< 10⁵) 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

分析：

N是一个数，D是进制。将N转换成D进制后反转，再转化回10进制的数，若转换前和转换后的数依旧为素数，Yes。此题较为简单。

C++代码如下。

#include<iostream>
#include<math.h>
#include<string>
#include<strstream>
using namespace std;

int isPrime(int I){
    if(I==1)
        return 0;
    for(int i=2;i<=sqrt(I);i++){
        if(I%i==0)
            return 0;
    }
    return 1;
}
int transDsystemAndReverse(int I,int D){
    if(!isPrime(I))
        return 0;
    string str="";
    while(I!=0){
        int yushu=I%D;
        strstream ss;
        string temp;
        ss<<yushu;
        ss>>temp;
        str=temp+str;
        I=I/D;
    }
    int res=0;
    for(int i=0;i<str.size();i++){
               res+=atoi(str.substr(i,1).c_str())*pow(D,i);
    }
    return isPrime(res);
}



int main(){
    while(true){
        int N,D;
        cin>>N;
        if(N<0)
            break;
        else{
            cin>>D;
            if(D<0)
                break;
            if(transDsystemAndReverse(N,D)){
                cout<<"Yes"<<endl;
            }
            else
                cout<<"No"<<endl;
                
        }
    }
    return 0;
}

测试显示，所有测试点都通过。