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 (<10​5​​) 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 <vector>
#include <math.h>
#include <algorithm>
#include <map>
#include <sstream>
#include <string.h>

using namespace std;

bool check(long long n)
{
    if(n<2)
        return false;
    for(long long i=2; i<=sqrt(n*1.0); i++)
    {
        if(n%i==0)
        {
            return false;
        }
    }
    return true;
}
bool checkNum(string s,int d)
{
    long long num=0;
    for(int i=s.length()-1; i>=0; i--)
    {
        num+=(s[i]-'0')*pow(d,s.length()-1-i);
    }
   // cout<<num<<endl;
    if(!check(num))
        return false;
    return true;
}

int main()
{
    while(1)
    {
        int n;
        cin>>n;
        if(n<0)
            break;
        int d;
        cin>>d;
        if(!check(n))
        {
            cout<<"No"<<endl;
            continue;
        }
        string s="";
        while(n/d>0)
        {
            s+=n%d+'0';
            n/=d;
        }
        s+=n+'0';
        if(!checkNum(s,d))
            cout<<"No"<<endl;
        else
            cout<<"Yes"<<endl;
    }

    return 0;
}