PAT A1015 2019.07.11 【素数 进制转换】

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

思路分析

题有点难懂，如果题干举一个2进制的例子就好理解多了

此题难点在于判素函数 与 进制转换，另外最后一个测试点未通过，望大佬指正！（18/20） 

#include<cstdio>
#include<iostream>
#include<cmath>
 
int isPrime(int n)//判素函数 
{
	if(n<=1)return 0;
    int sqr = (int)sqrt(1.0*n);//此处需要进行优化，否则会有测试点超时
	for(int i=2;i<=sqr;i++)
	{
	    if(n%i == 0)return 0;																		 
	}
	return 1;
} 

int reverseNum(int n)//返回 n 的逆置数 
{
	int arr[10];
	int temp=0;
	while(1)
	{
		if(n>=10)
		{
			arr[temp++]=n%10;
		    n=n/10;
		}
		else 
		{
			arr[temp++]=n;
			break;
		}
	}
	int returnNum=0;
	for(int i=0;i<temp;i++)
	{
		returnNum=returnNum+arr[temp-i-1]*pow(10,i);
    }
	return returnNum;
}

int transNum(int n,int d)//十进制转换为进制转换 --十进制内都为除 N 取余 逆序取余 
{
	int arr[100];
	int temp=0;
	while(1)
	{
	   arr[temp++]=n%d;
	   n=n/d;
	   if(n==0)break;
	}
	
	int returnNum=0;
	for(int i=0;i<temp;i++)
	{
		returnNum = returnNum+arr[temp-1-i]*pow(10,temp-1-i);
	}
	return returnNum;
} 

int nToD(int n,int d)//d进制数转换为 10进制数 
{
	int returnNum=0;
	int temp=0;
	while(1)
	{
		returnNum=returnNum +  n%10*pow(d,temp++);
		n=n/10;
		if(n==0)break;
	} 
	return returnNum;
} 


int main()
{
	int N=0,D=0;
	int former=0,later=0;
	while(1)
	{
		scanf("%d",&N);
		if(N<0)return 0;
		scanf("%d",&D);
        former = N;
        later =  nToD(reverseNum(transNum(N,D)),D);//先转换为D进制，逆置后再转换为十进制 
		if(isPrime(former)&&isPrime(later))																			 
        printf("Yes\n");
        else printf("No\n");
	}	
	
}