package com.hj.shoujihao;
public class Text { public static void main(String[] args) { int i = 0; for (i = 100; i <= 200; i++) { int j = 0; for (j = 2; j < i; j++) { if (i%j == 0)//如果能被整除,则表面次数不是素数,反之是素数不输出 break; } if (j == i)//i只能被自身整除 { System.out.println(j); } }
}
}