A1015 Reversible Primes_reversible primes 错误-CSDN博客

本文链接：https://blog.csdn.net/qq_40287093/article/details/89415350

A1015 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:

Yes
Yes
No

题目有几个要点：

判断素数的时候考虑n<=1时返回false

注意判断素数条件 i <= (int)sqrt(n * 1.0)

进制转换的时候不要乘错，乘以d 而不是乘以 10

输入终止条件的判断

#include <iostream>
#include <math.h>
using namespace std;
bool isPrime(int n){
  if(n <= 1) return false;
  for(int i = 2; i <= (int)sqrt(n * 1.0); i++){
    if(n % i == 0) return false;
  }
  return true;
}

int tran(int n, int d){       //将n转换成d进制后，翻转后再转为十进制
  int sum = 0;
  string s = "";
  while(n > 0){
    s += to_string(n % d);
    n = n / d;
  }
  for(int i = 0; i < s.length(); i++){
    sum = sum * d + (s[i] - '0');
  }
  return sum;
}

int main(){
  int n,d,m;
  while(scanf("%d", &n) != EOF){
	if(n < 0) break;
	scanf("%d", &d);
	if(!isPrime(n)){
	  cout << "No" << endl;
	  continue;
	}
  m = tran(n, d);
  if(isPrime(m)) 
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
  }
  return 0;
}