A1015 Reversible Primes
Link
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
Code
简单题 , 两个考点:
1、进制转换;2、判断素数。
进制转换
# 10进制转为d进制,d进制的倒数再转10进制,x为待转的d进制数
while(x)
{
y = y*d + (x % d);
x = x / d;
}
判断素数
# 最常规的判断素数方法
bool Isprime(int temp)
{
if(temp==0 || temp==1)
return false;
for(int i=2;i<=sqrt(temp);i++)
if(temp%i == 0)
return false;
return true;
}
AC Code:
#include<bits/stdc++.h>
using namespace std;
bool Isprime(int temp)
{
if(temp==0 || temp==1)
return false;
for(int i=2;i<=sqrt(temp);i++)
if(temp%i == 0)
return false;
return true;
}
int main()
{
int n,d,y,product;
while(cin>>n)
{
if(n<0)
break;
else
{
y = 0 , product = 1;
cin>>d;
int x = n;
while(x)
{
y = y*d + (x % d);
x = x / d;
}
if(Isprime(n) && Isprime(y))
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
}
}
}