#include<cstdio>#include<cstring>#include<cmath>#include<algorithm>usingnamespace std;intReser(int x,int d){int temp[30];int i =0;while(x){
temp[i++]= x % d;
x /= d;}reverse(temp, temp + i);int sum =0;for(int j =0; j < i; j++) sum += temp[j]*pow(d, j);return sum;}boolisPrime(int x){if(x <=1)returnfalse;for(int i =2; i <=sqrt(x); i++)if(x % i ==0)returnfalse;returntrue;}intmain(){int n, d, ret;while(scanf("%d",&n), n >0){scanf("%d",&d);
ret =Reser(n, d);if(isPrime(n)&&isPrime(ret))printf("Yes\n");elseprintf("No\n");}return0;}
1013 数素数解题代码测试结果问题整理解题代码#include<cstdio>#include<cstring>#include<cmath>#include<algorithm>using namespace std;int Reser(int x,int d) { int temp[30]; int i = 0; while (x) { temp[i++] = x % d; x /= d; } reverse(temp,