题目:
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.(当输入的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和D,题目要求,当N是素数且N以D为基数时也是素数,就输出Yes,否则输出No;
思路:
(1).先判断N是否是素数,不是素数,直接输出No;是素数进行第(2)步;
(2).把十进制的N,转换成以D为基数的数字;
(3).把转换后的数字再反转后再转换成十进制的数字;
(4).判断反转后的数字是否是素数;
提示:在转换进制和再转换成十进制数字时可以使用队列(queue)来作为中间的过度,这样这道题会更简单。
代码如下:
#include<stdio.h>
#include<string.h>
#include<queue>
#include<algorithm>
using namespace std;
int p[101000];
int n,d;
void init()//素数打表;
{
memset(p,0,sizeof p);
p[1]=1;
for(int i=2; i<=101000; i++)//等于1代表不是素数,等于0代表是素数;
{
if(p[i]==0)
{
for(int j=2; j*i<=101000; j++)
p[i*j]=1;
}
}
return ;
}
queue<int>q;
int flag=0;
int main()
{
init();
while(~scanf("%d",&n))
{
if(n<0)//注意结束的条件;
break;
scanf("%d",&d);
if(p[n]==1)//不是素数;
printf("No\n");
else
{
while(!q.empty())//清空队列;
q.pop();
int k=n;
while(k)//转换进制;
{
q.push(k%d);
k=k/d;
}
k=0;
while(!q.empty())//反转后转换成十进制;
{
k=k*d+q.front();
q.pop();
}
//printf("k=====%d\n",k);
if(p[k]==0)//判断转换后的数是否是素数;
printf("Yes\n");
else
printf("No\n");
}
}
return 0;
}