输入样例
5 27
输出样例
11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103
注意点:
第10000个素数的大小为104729!
//可以自己去验证 public int getPrime(int n) { int count = 1; int ans = 0; int index = 2; while (count <= n) { if (isPrime(index)) { ans = index; count++; } index++; } return ans; }
import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc=new Scanner(System.in); int m,n,index=0,count=0; m=sc.nextInt(); n=sc.nextInt(); int[] prime=new int[10001]; for (int i = 2; i <104730; i++) { if (index > 9999) break; if (is_prime(i)) prime[++index] = i; } for (int i = m; i <=n; i++) { count++; if (count%10==0) System.out.println(prime[i]); else { if (i==n){ System.out.print(prime[i]); break; }else System.out.print(prime[i] + " "); } } } public static boolean is_prime(int num){ int sqrt = (int) Math.sqrt(num); for (int i = 2; i <= sqrt; i++) { if (num % i == 0) { return false; } } return true; } }
欢迎分享,转载请注明来源:内存溢出
评论列表(0条)