求质数

求质数

 

package com.baidu.zhidao;

 

public class PrimeNumbers {

 

private static int count = 0;

public static void main(String[] args) {

for (int i = 101; i < 200; i++) {

boolean flag = true;

double num = Math.sqrt(i);

for(int j = 2;j<num;j++){

if(i%j==0){

flag = false;

break;

}

}

if(flag){

count++;

System.out.println(i);

}

}

System.out.println("Between 100 and 200 there are: "+count +" PrimeNumber");

}

}