1015. Reversible Primes (20)

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

逆水之天

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

阅读量338

点赞数

分类专栏： pat 文章标签： pat1015

本文链接：https://blog.youkuaiyun.com/u010194274/article/details/48223539

版权

pat 专栏收录该内容

7 篇文章

订阅专栏

本文介绍了如何判断一个给定的正整数在任意指定进制下是否为可逆质数，并提供了一个示例程序代码。可逆质数是指其在该进制系统下的反转数也是质数的数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

#include
   
   
    
    
#include
    
    
     
     
#include
     
     
      
      
using namespace std;
int is_prime(int n)
{
int i,k=floor(sqrt(n)+0.5);
if(n==1) return 0;//1不是素数
for(i=2;i<=k;i++)
{
  if(n%i==0) return 0;
}
return 1;
}
int is_reverse(int n,int radix)
{
 int que[100];
 int len=0,j,i;
 long int rad,conseq=0;
 if(is_prime(n))
 {
 while(n!=0)
 {
 que[len++]=n%radix;
 n/=radix;
 }
 for(i=0;i