【PAT甲级】 1015 Reversible Primes

最新推荐文章于 2024-08-08 15:12:59 发布

i柠lemon檬

最新推荐文章于 2024-08-08 15:12:59 发布

阅读量687

点赞数

分类专栏： PAT 文章标签：算法数据结构 c++

本文链接：https://blog.csdn.net/lemon1219/article/details/123044793

版权

PAT 专栏收录该内容

18 篇文章 0 订阅

订阅专栏

【PAT甲级】 1015 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 (<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:

Sample Output:

Yes
Yes
No

思路

题目要求

给定一个素数及他的进制，求该素数在给定进制下是否为可逆素数（即倒转过来依旧是素数）；输入为负数就终止

题目分析

求逆的时候要记得按对应的进制去求；
依据题意，并没有说给定的数一定是素数，故也要进行判断；

参考代码如下

#include <iostream>
#include <cmath>
using namespace std;
bool isPrime(int num){
	if(num==0 || num==1 || num==3){
		return false;
	}
	if(num==2 || num==3){
		return true;
	}
	for(int i=2;i<=sqrt(num);i++){
		if(num%i==0)
			return false;
	}
	return true;
}
int main() {
	int n,d;
	while(scanf("%d",&n)){
		if(n<0)
			break;
		scanf("%d",&d);
		if(!isPrime(n)){//先判断再转换，万一本身就不是素数可以减少时间
			printf("No\n");
            continue;
		}
		int num=0,m=n%d;
		n/=d;
		while(n){
			m=m*d+n%d;
			n/=d;
		}
        printf("%s", isPrime(m) ? "Yes\n" : "No\n");
	}
}