32 lines
711 B
Java
32 lines
711 B
Java
|
package Course_Codes;
|
|||
|
|
|
|||
|
|
import java.util.Arrays;
|
|||
|
|
|
|||
|
|
//Ҫ<>õ<EFBFBD><C3B5><EFBFBD>Ȼ<EFBFBD><C8BB>n<EFBFBD><6E><EFBFBD>ڵ<EFBFBD>ȫ<EFBFBD><C8AB><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ѳ<EFBFBD><D1B2><EFBFBD><EFBFBD>ڸ<EFBFBD><DAB8><EFBFBD>n<EFBFBD><6E><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ı<EFBFBD><C4B1><EFBFBD><EFBFBD><EFBFBD><DEB3><EFBFBD>ʣ<EFBFBD>µľ<C2B5><C4BE><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|||
|
|
public class <EFBFBD><EFBFBD><EFBFBD><EFBFBD>ɸ<EFBFBD><EFBFBD> {
|
|||
|
|
|
|||
|
|
public static void main(String[] args) {
|
|||
|
|
int n=10000;
|
|||
|
|
boolean isprime[]=new boolean[n+1];
|
|||
|
|
Arrays.fill(isprime, true);//<2F>ٶ<EFBFBD>ȫ<EFBFBD><C8AB><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|||
|
|
//<2F>ж<EFBFBD><D0B6><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>0 1
|
|||
|
|
isprime[0]=false;
|
|||
|
|
isprime[1]=false;
|
|||
|
|
|
|||
|
|
for(int i=2;i*i<=n;i++) {
|
|||
|
|
if(isprime[i]==true)
|
|||
|
|
for(int j=2;i*j<=n;j++) //<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>2i,3i,4i....<2E><>
|
|||
|
|
isprime[i*j]=false;
|
|||
|
|
}
|
|||
|
|
int count=0;
|
|||
|
|
for(int i=2;i<=n;i++) {
|
|||
|
|
if(isprime[i]==true) {
|
|||
|
|
count++;
|
|||
|
|
System.out.println(i);
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
System.out.printf("<EFBFBD><EFBFBD>1<EFBFBD><EFBFBD>%d<><64><EFBFBD><EFBFBD><EFBFBD><EFBFBD>%d<><64><EFBFBD><EFBFBD><EFBFBD><EFBFBD>", n,count);
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
}
|