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
题目大意时首先判断一个数n是不是素数,然后将这个数字radix进制化,然后将radix进制下的数颠倒,再求它的十进制数是不是素数,如果都是素数则输出Yes,否则输出No,当n为负数时候结束;
本题目有两种方法,一种是筛选法,另一种是直接判断法;
AC
筛选法
#include<stdio.h>
const int maxn=100010;
bool p[maxn]={0};
void find(int n){
p[1]=true;
for(int i=2;i<maxn;i++){
if(p[i]==false){
for(int j=i+i;j<maxn;j=j+i){
p[j]=true;
}
}
}
}
int main(){
int temp,radix;
find(maxn);
while(1){
scanf("%d",&temp);
if(temp<0)break;
scanf("%d",&radix);
if(p[temp]==true){
printf("No\n");
}else{
int sum=0,num=0, a[32];
do{
a[num++]=temp%radix;
temp=temp/radix;
}while(temp!=0);
for(int i=0;i<num;i++){
sum=sum*radix+a[i];
}
if(p[sum]==false){
printf("Yes\n");
}else{
printf("No\n");
}
}
}
}
直接判断法
#include<stdio.h>
#include<math.h>
bool is_prime(int n){
if(n<=1)return false;
int k=(int)sqrt(1.0*n);
for(int i=2;i<=k;i++){
if(n%i==0){
return false;
}
}
return true;
}
int main(){
int temp,radix;
while(1){
scanf("%d",&temp);
if(temp<0)break;
scanf("%d",&radix);
if(is_prime(temp)==false){
printf("No\n");
}else{
int a[35],sum=0,num=0;
do{
a[num++]=temp%radix;
temp=temp/radix;
}while(temp!=0);
for(int i=0;i<num;i++){
sum=sum*radix+a[i];
}
if(is_prime(sum)==true){
printf("Yes\n");
}else{
printf("No\n");
}
}
}
}