代码源自:https://blog.csdn.net/cv_jason/article/details/81288111
#include<iostream>
#include<cmath>
using namespace std;
int isprime(int n)
{
if(n<=1)return 0;
int sqr=int(sqrt(n)+1);
for(int i=2;i<sqr;i++)
{
if(n%i==0) return 0;
}
return 1;
}
int main(){
int n,d;
while(scanf("%d",&n)!=EOF){
if(n<0) break;
scanf("%d",&d);
if(isprime(n)==0){
cout<<"No\n";
continue;
}
int len=0,arr[100];
do{
arr[len++]=n%d;
n=n/d;
}while(n!=0);
for(int i=0;i<len;i++)
n=n*d+arr[i];
cout<<(isprime(n)? "Yes\n":"No\n");
}
return 0;
}