Reversible Primes（题目意思没看懂？快进来看看！）

最新推荐文章于 2022-07-27 16:13:26 发布

此杭非彼航

最新推荐文章于 2022-07-27 16:13:26 发布

阅读量272

点赞数 3

分类专栏： PAT题目练习文章标签： PAT

本文链接：https://blog.csdn.net/ljhsq/article/details/116661755

版权

PAT题目练习专栏收录该内容

154 篇文章 5 订阅

订阅专栏

Reversible Primes

题目
答案
题目含义解析

题目

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 (<105 ) 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:

Sample Output:

Yes
Yes
No

答案

#include<iostream>
#include<vector>
#include<math.h>
using namespace std;

int check(int tmp)
{
	if(tmp==1||tmp==0) return 0;
	else if(tmp==2) return 1;
	for(int i=2;i<=sqrt(tmp)+1;i++)
	{
		if(tmp%i==0) return 0;
	}
	return 1;
}
int main()
{
	while(1)
	{
		int num,radix;
		vector<int> vec;
		cin>>num;
		if(num<0) break;
		else cin>>radix;
		int sum1=0,sum2=0;
		while(num!=0)
		{
			vec.push_back(num%radix);
			num/=radix;
		}
		for(int i=vec.size()-1;i>=0;i--)
		sum1=sum1*radix+vec[i];
		for(int i=0;i<vec.size();i++)
		sum2=sum2*radix+vec[i];
		int flag1=check(sum1),flag2=check(sum2);
		if(flag1&&flag2) cout<<"Yes"<<endl;
		else cout<<"No"<<endl;
	}	
}