1015 Reversible Primes (20 分)

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

Shine_YP

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

阅读量284

点赞数

分类专栏： PAT甲级C++题解

本文链接：https://blog.csdn.net/m0_48118006/article/details/122927946

版权

c++ 数据结构算法

PAT甲级C++题解专栏收录该内容

28 篇文章 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 (<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

Sample solution：

#include <bits/stdc++.h> 
using namespace std;

//计算题，重在理解题目中的定义，所谓n为基数d的反转素数<->十进制数n是素数，将n转化为d进制数后反转，反转数化为十进制后依然是素数
bool isprime(int n) {
    if(n <= 1) return false;
    int sqr = int(sqrt(n * 1.0));
    for(int i = 2; i <= sqr; i++) {
        if(n % i == 0)
            return false;
    }
    return true;
}
int main() {
    int n, d;
    int arr[100]={},num,sum=0;
    cin>>n;
    while(n>0){
    	cin>>d;
    	if(isprime(n)){
    		num=0;
    		while(n){
    			arr[num]=n%d;
    			n=n/d;
    			num++;
			}
			sum=0;
			for(int i=0;i<num;i++){
				sum+=arr[i]*pow(d,num-1-i);
			}
			if(isprime(sum)){
			cout<<"Yes"<<endl;	
			}
			else cout<<"No"<<endl;
		}
		else cout<<"No"<<endl;
		cin>>n;
	}
    return 0;
}