PAT 1015 Reversible Primes

1015. Reversible Primes (20)

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.

73 10
23 2
23 10
-2

Yes
Yes
No
#include 
#include 
#include 
#include 
#include 
#include 
#include using namespace std;
int n,d;
int bin[105];
bool judge(int x)
{if(x==1||x==0) return false;if(x==2) return true;for(int i=2;i*i<=x;i++){if(x%i==0)return false;}return true;
}
void fun(int x,int d)
{int cnt=0;while(x>=d){bin[cnt++]=x%d;x/=d;}if(x>0)bin[cnt++]=x;int num=0;for(int i=0;i

本文来自互联网用户投稿，文章观点仅代表作者本人，不代表本站立场，不承担相关法律责任。如若转载，请注明出处。 如若内容造成侵权/违法违规/事实不符，请点击【内容举报】进行投诉反馈！