# 1015. Reversible Primes (20)

83人阅读 评论(0)

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");
}
}
0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：80582次
• 积分：4125
• 等级：
• 排名：第8267名
• 原创：345篇
• 转载：9篇
• 译文：0篇
• 评论：17条
阅读排行
评论排行
最新评论