package know1;
import java.util.Scanner;
public class Prime
{
public static boolean isPrime(int n)
{
if(n<=1) return false;
int b=(int) Math.sqrt(n);
for(int i=2;i<=b;i++)
{
if(n%i==0) return false;
}
return true;
}
public static void main(String[] args)
{
Scanner in=new Scanner(System.in);
int n=in.nextInt();
System.out.println("0到"+n+"范围内的素数有:");
for(int i=2;i
if(isPrime(i)) System.out.print(i+" ");
in.close();
}
}
取消
评论