PAT-Advanced-1015. Reversible Primes

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:

Sample Output:

这道题忘了是什么时候做的了(反正也很简单……细节已经忘记了),看到自己的repo里有,顺手更新了上来。

不过感觉自己写的那句 while(scanf("%d",&n),n>=0) 有种好鬼畜的感觉……

代码如下:

发表评论

电子邮件地址不会被公开。 必填项已用*标注