# 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 (< 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:

73 10
23 2
23 10
-2

Sample Output:

Yes
Yes
No

#include <bits/stdc++.h>
using namespace std;
bool isprime(int n){
if(n<2)
return false;
for(int i=2;i*i<=n;++i){
if(n%i==0)
return false;
}
return true;
}
int m=0;
while(num){
}
return m;
}
int main(){
while(cin>>n&&n>=0){
puts("Yes");
else puts("No");
}
}

#### pat1015Reversible Primes (20)

2015-10-02 21:30:30

#### PAT甲级1015. Reversible Primes (20)

2017-02-26 21:52:31

#### 1015 Reversible Primes (20)

2018-05-24 17:23:41

#### 1015. Reversible Primes (20)-PAT甲级真题

2016-08-08 21:08:07

#### PAT.A.1015.Reversible Primes

2017-01-14 15:39:02

#### PAT(甲) 1015 Reversible Primes (20)（详解）

2018-06-02 09:13:59

#### PAT(Advanced Level) 1015 - Reversible Primes(水题)

2016-12-06 16:38:36

#### PAT (Advanced Level) Practise 1015 Reversible Primes (20)

2016-03-03 23:33:31

#### pat 1015Reversible Primes (20)

2018-03-28 12:42:04

#### 1015 Reversible Primes

2016-11-28 20:31:56