原题
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
大体题意
给一个数和它是几进制,要求判断它是不是素数,如果是素数,要求判断在n进制基础上,它的水平翻转的数转换为十进制是不是素数
思路
涉及三点,进制转换、素数判断以及水平翻转
代码
#include <iostream>
#include <math.h>
using namespace std;
bool isprime(int n)
{
if (n <= 1)
return false;
int sqr = (int)sqrt(1.0 * n);//因为sqrt的参数要求是浮点数,因此在n前面乘以1.0来使其成为浮点型
for (int i = 2; i <= sqr; i++)
if (n % i == 0)
return false;
return true;
}
int change(int n, int d)
{
int a[10000];
int i = 0;
while (n != 0)
{
a[i++] = n % d;
n = n / d;
}
int b[10000], j;
for (j = 0; j < i; j++)
{
b[i - 1 - j] = a[j];
}
int sum = 0, l = 1;
for (j = 0; j < i; j++)
{
sum += b[j] * l;
l = l * d;
}
return sum;
}
int main()
{
int n, d, k;
cin >> n;
while (n > 0)
{
cin >> d;
if (isprime(n))
{
k = change(n, d);
if (isprime(k))
cout << "Yes" << endl;
else
cout << "No" << endl;
}
else
cout << "No" << endl;
cin >> n;
}
}