PAT 1015 Reversible Primes

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

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define maxnum 100005

bool check[maxnum];
int prime[maxnum] = {};

void isprime(){
    int cnt = ;
    memset(check,true,sizeof(check));
    for(int i=;i < maxnum;i++){
        if(check[i])prime[++cnt] = i;
        for(int j=;j <= cnt;j++){
            if(i*prime[j] > maxnum)break;
            check[i*prime[j]] = false;
            if(i%prime[j] == )break;
        }
    }
}

int main(){
    int a,b;
    isprime();
    check[] = false;
    check[] = false;

//    for(int i=0;i < 1000;i++){
//        cout << check[i] << " ";
//    }
    while(scanf("%d",&a)){
        if(a < ) break;
        scanf("%d",&b);
        vector<int> vec;
        int t = a;
        while(a){
            vec.push_back(a%b);
            a = a/b;
        }
        int sum = ;
        int cnt = ;
        for(int i=vec.size()-;i >= ;i--){
            sum += cnt*vec[i];
            cnt *= b;
        }
        if(check[sum]&&check[t]) cout << "Yes" << endl;
        else cout << "No" << endl;
    }
    return ;
}

复习欧拉筛