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

 

作者: CHEN, Yue

单位: 浙江大学

时间限制: 400 ms

内存限制: 64 MB

代码长度限制: 16 KB

---

编译器 (31)

#include<iostream>
#include<cstdio>
#include<cmath>
#include<vector>

using namespace std;

bool isPrime(int n,int d)
{
    if(n<=1)
        return false;
    for(int i=2; i*i<=n; i++)
    {
        if(n%i==0)return false;
    }
    vector<int> num;
    while(n)
    {
        num.push_back(n%d);
        n=n/d;
    }
    int len=num.size();
    for(int i=0; i<len; i++)
        n=n*d+num[i];
    if(n<=1)
        return false;
    for(int i=2; i*i<=n; i++)
    {
        if(n%i==0)
            return false;
    }
    return true;
}

int main()
{
    int n,d;
    while(scanf("%d",&n)!=EOF)
    {
        if(n<0)
            break;
        scanf("%d",&d);
        if(isPrime(n,d))
            printf("Yes\n");
        else
            printf("No\n");

    }

    return 0;
}