PAT A 甲级 1015 Reversible Primes (20分)

1015 Reversible Primes (20分)

吐槽

说实话做之前我真不确定0和1是不是质数。
以及这道题居然是“以负数输入为结束”而不是一贯的先给个说明之后要输入几次的n！这一点都不PAT！

思路

没啥好说的。一个判断是不是质数的函数、一个进制转化的部分，都是基础操作。

唯一要特别注意的是1和0不是质数。（测点1）
而且这句特判必须写在判断的函数里，而不是直接判断输入的n是不是0或1，因为诸如10翻转后也会变成01，也就是1。

代码

#include<iostream>
#include<vector>
#include<string>
#include<math.h>

using namespace std;

bool prime(int num)
{
	int i;
	if (num < 2)
		return false;
	for (i = 2; i <= sqrt(num); i++)
	{
		if (num%i == 0)
			return false;
	}
	return true;
}

int main()
{
	int n, d, i;
	string s;
	cin >> n;
	while (n > 0)
	{
		cin >> d;
		s = "";
		if (!prime(n))
		{
			cout << "No" << endl;
			cin >> n;
			continue;
		}
		while (n > 0)
		{
			s = to_string(n % d) + s;
			n = n / d;
		}
		n = 0;
		for (i = 0; i < s.size(); i++)
		{
			n += (s[i] - '0') * pow(d, i);
		}
		if (prime(n))
			cout << "Yes" << endl;
		else
			cout << "No" << endl;
		cin >> n;
	}
	return 0;
}

题目

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 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:
73 10
23 2
23 10
-2

Sample Output:
Yes
Yes
No