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 (<10^5 ) and(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
补充:
1、如果题目没有给定的输入结束条件,那么就默认读到文件末尾,scanf读到文件末尾后无法读取后返回-1,C语言中使用EOF代表-1。
while (scanf("%d",&n) != EOF)
{
.....
}
这道题我们也可以采用这种读取方式,先读取一个数,如果该数小于0,则break,反之,继续读入第二个数。
2、注意数据为1时,判断其不是素数,不要忽略了。
我的代码:
#include<cstdio>
bool isPrime(int num)
{
if (num == 1) return false;
for (int i = 2 ;i * i <= num ;i++)
{
if (num % i == 0)
return false;
}
return true;
}
int reverse(int num,int radix)
{
int sum = 0;
while (num != 0)
{
sum = sum * radix + (num % radix);
num /= radix;
}
return sum;
}
int main()
{
int n,d;
while (scanf("%d",&n) != EOF)
{
if (n < 0) break;
scanf("%d",&d);
if (isPrime(n))
{
if (isPrime(reverse(n,d)))
printf("Yes\n");
else
printf("No\n");
}
else
printf("No\n");
}
return 0;
}