package interview;
import java.util.Scanner;
public class prime {
//找出不大于n的最大质数
static Scanner sc = new Scanner(System.in);
public static void main(String[] args) {
test();
}
public static void test(){
System.out.println("请输入n");
int n = sc.nextInt();
for (int i = n-1; i >0; i--) {
boolean flag = true;
for (int j = 2; j < i; j++) {
if (i%j==0){
flag = false;
break;
}
}
if (flag){
System.out.println(i);
break;
}
}
}
}
找出不大于n的最大质数
最新推荐文章于 2023-04-18 21:55:46 发布