1015 Reversible Primes（素数判断+进制转换）

最新推荐文章于 2022-02-22 19:31:52 发布

Oliver_H_

最新推荐文章于 2022-02-22 19:31:52 发布

阅读量97

点赞数

分类专栏： PAT甲级

本文链接：https://blog.csdn.net/nnnnnick/article/details/98532931

版权

PAT甲级专栏收录该内容

32 篇文章 0 订阅

订阅专栏

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<cstdio>
#include<cmath>
using namespace std;
const int maxn=100100;
bool judge(int n){//这个是单纯判断是否是素数的写法。素数表的写法另行复习 
	if(n<=1) return false;
	int sq=int(sqrt(n*1.0));
	for(int i=2;i<=sq;i++){
		if(n%i==0)
			return false;
	}
	return true;
}
int main(){
	int n,d;
	while(~scanf("%d",&n)){
		if(n<0)
			break;
		scanf("%d",&d);
		if(judge(n)==false){
			printf("No\n");
			continue;
		}
		int array[100];//100000的二进制也不过17位
		int len=0;
	/*
		下面这段如果d是二进制,八进制等不好理解的进制就不要硬钻，用135和10进制当例子来理解。
		所有进制算法步骤都一样，实质都一样，不要过多纠结。 
	*/
		do{//把n按d进制转换后逆序存储 
			array[len++]=n%d;
			n/=d;
		}while(n);
		for(int i=0;i<len;i++){
			n=n*d+array[i];
		}
		printf("%s",judge(n)?"Yes\n":"No\n");
	}
	return 0;
}