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:
73 10
23 2
23 10
-2
Sample Output:
Yes
Yes
No
代码
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
bool isPrime(int number)
{
if(number == 1) return false;
for (int i = 2; i <= sqrt(number); i++)
{
if (number % i == 0)
return false;
}
return true;
}
void to_radix(int number, vector<int> &res, int radix)
{
while (number)
{
res.push_back(number % radix);
number /= radix;
}
reverse(res.begin(), res.end());
return;
}
int to_number(vector<int> &numbers, int radix)
{
int res = 0;
for (auto num : numbers)
{
res = res * radix + num;
}
return res;
}
int main()
{
while (true)
{
int number = 0, radix = 0;
cin >> number;
if (number < 0)
break;
cin >> radix;
if (!isPrime(number))
{
cout << "No" << endl;
continue;
}
vector<int> radix_number;
to_radix(number, radix_number, radix);
reverse(radix_number.begin(), radix_number.end());
int reverse_number = to_number(radix_number, radix);
if (!isPrime(reverse_number))
{
cout << "No" << endl;
continue;
}
cout << "Yes" << endl;
}
return 0;
}
总结
1. 首先根据题意,写出main函数的主要部分,然后根据需要实现对应的函数。
2. 判断质数,明确1不是质数,判断质数可以采用循环到开方数位置即可。另外可以参考埃氏筛确定构造质数地图,然后判定,不过本题时间复杂度允许,无需构造。
3. 剩下的就是进制转化,老生常谈了。