改良版:
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
while (true) {
int n = scanner.nextInt();
if (n < 0) break;
int m = scanner.nextInt();
if (!isPrime(n)) {
System.out.println("No");
} else {
String str = Integer.toString(n, m); //10->r
int value = translate(str, m);
if (isPrime(value)) {
System.out.println("Yes");
} else {
System.out.println("No");
}
}
}
}
public static int translate(String n,int r){
int sum=0;
for (int i=n.length()-1;i>=0;i--){
sum=sum*r+(n.charAt(i)-'0');
}
return sum;
}
public static boolean isPrime(int number) {//判断素数
// 小于2的数都不是素数
if (number < 2) {
return false;
}
for (int i=2;i*i<=number;i++){
if (number%i==0) return false;
}
return true;
}
}
原版:
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
while (true) {
int n = scanner.nextInt();
if (n < 0) break;
int m = scanner.nextInt();
if (!isPrime(n)) {
System.out.println("No");
} else {
String str = Integer.toString(n, m); //10->r
int value = translate(str, m);
if (isPrime(value)) {
System.out.println("Yes");
} else {
System.out.println("No");
}
}
}
}
public static int translate(String n, int r) {//将r进制下的字符串n转化为10进制下的逆置后的数
int sum = 0;
for (int i = 0, unit = 1; i < n.length(); i++, unit *= r) {
sum += unit * (n.charAt(i) - '0');
}
return sum;
}
public static boolean isPrime(int number) {//判断素数
if (number < 2) {
return false;
}
for (int i=2;i*i<=number;i++){
if (number%i==0) return false;
}
return true;
}
}