版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/u013383042/article/details/77802947
题目:求100以内的素数,全部打印出来。
public class ZhaoSuShu {
public static void isPrime1(){
int i,j,count = 0;
//System.out.println("2");
for(i = 1; i <= 100; i++){
for(j = 2; j <= i; j++){
if(i % j == 0){
break;
}
}
if(j == i){
count++;
System.out.print(i + " ");
if(count % 5 == 0){
System.out.println();
}
}
}
}
public static void isPrime2(){
int i,j,count = 0;
boolean flag;
for(i = 1; i <= 100; i++){
flag = true;
for(j = 2; j <= Math.sqrt(i); j++){
if(i % j == 0){
flag = false;
break;
}
}
if(i != 1 && flag == true){
count++;
System.out.print(i + " ");
if(count % 5 == 0){
System.out.println();
}
}
}
}
public static void main(String[] args) {
// TODO Auto-generated method stub
isPrime1();
// isPrime2();
}
}