1015. Reversible Primes (20)

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
#include<stdio.h>
#include<string.h>
#include<iostream>
#include<math.h>
#define MAXSIZE 100000
using namespace std;

bool isPrime(int N)
{
    int i=0;
    if(N==1) return false;
    for(i=2;i<=sqrt(N);i++) //注意是i<=sqrt(),之前弄成i<sqrt,一直出错
    {
        if(N%i==0)
            return false;
    }
    return true;
}
int trans2decimal(int N,int M)
{
    int arr[MAXSIZE];
     memset(arr,0,sizeof(arr));
    int i =0;
    while(N)
    {
        arr[i]=N%M;
        N=N/M;
        i++;
    }
    int temp=i-1;
    int decimal=0,j=0;
    for(i=temp;i>=0;i--)
    {
        decimal+=pow(M,j)*arr[i];
        j++;
    }


    return decimal;

}
int main()
{
    int N,M;

    while(scanf("%d",&N)!=EOF)
    {
        if(N<0)
            break;
        cin>>M;
        if(isPrime(N)){
            int integer = trans2decimal(N,M);
            if(isPrime(integer))
                cout<<"Yes"<<endl;
            else
                cout<<"No"<<endl;
        }
        else
        {
            cout<<"No"<<endl;
        }


    }

    return 0;
}