1015. Reversible Primes (20)

最新推荐文章于 2024-02-22 13:10:55 发布

Star1996

最新推荐文章于 2024-02-22 13:10:55 发布

阅读量188

点赞数

分类专栏： PAT甲级刷题记录

本文链接：https://blog.csdn.net/Star1996/article/details/75005821

版权

PAT甲级刷题记录专栏收录该内容

19 篇文章 0 订阅

订阅专栏

1015. Reversible Primes (20)

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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

表示被自己蠢哭：0、1不是素数，但是2是素数

题目较简单，输入的N为10进制，将N转换为D进制的数，反转后在转回10进制，判断N和N在D进制下反转是否都为素数，若是则输出Yes，否则输出No

#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
bool isPrime(int N)
{
  if(N==3)return true;
  if(N==0||N==1)return false;
  for(int i=2;i*i<=N;i++)
    {
      if(N%i==0)return false;
    }
  return true;
}
int reversible(int N,int D)
{
  int ans=0;
  do
    {
      ans*=D;
      ans+=N%D;
      N/=D;
    }while(N!=0);
  return ans;
}
int main()
{
  int N,D;
  while(cin>>N)
    {
      if(N<=0)break;
      cin>>D;
      if(isPrime(N)&&isPrime(reversible(N,D)))
	{
	  cout<<"Yes\n";
	}
      else
	{
	  cout<<"No\n";
	}
    }
  return 0;
}