学步园

package stone;<br /> public class PrimerNumber {<br /> public static void main(String[] args) {<br /> int MAX_NUMBER = 100;<br /> boolean[] notPrimer= new boolean[MAX_NUMBER];<br /> for(int i=2;i<=MAX_NUMBER;i++){<br /> if(!notPrimer[i-1]){<br /> for(int j=2*i;j<=MAX_NUMBER;j++){<br /> if(j%i==0) notPrimer[j-1]=true;<br /> }<br /> }<br /> }<br /> for(int i=0;i<MAX_NUMBER;i++){<br /> if(!notPrimer[i]) System.out.print(i+1+" ");<br /> }<br /> }<br /> }

运行结果如下:

1 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97