for(int i=2; i < 100; i++){
for(int j = 2;j < 100; j++){
if(i != j){
if((j % i) != 0){
System.out.println(i + "是质数" );
break;
}
}
}
}
for(int j = 2;j < 100; j++){
if(i != j){
if((j % i) != 0){
System.out.println(i + "是质数" );
break;
}
}
}
}
for(int j = 2;j < 100; j++){
if(i != j){
if((j % i) != 0)){
System.out.println(i + "是质数" );
break;
}
}
}
}
int l = (int)(Math.sqrt(i));
for(int j=2; j<=l; j++){
if(i%j==0) break;
if(j==l)
System.out.println(""+i+" is a prime.");
}
}
for (int i = 1; i <= 100 ; i++) {
boolean flag = true;
for (int j = 2; j < i; j++) {
if ( i%j == 0) {
flag = false;
}
}
if (flag)
System.out.println(i);
}
}
class Prime
{
public static void main(String[] args)
{
boolean flag=true;
for(int m=2;m<100;m++)
{
int k = (int)(Math.sqrt(m));
for(int i=2;i<k+1;i++)
if (m%i==0)
{ flag=false;
break;}
else flag=true;
if (flag==true)
{System.out.println(m);
}
}
}
}
boolean flag = true;
for (int j = 2; j < i; j++) {
if ( i%j == 0) {
flag = false;
}
}
if (flag)
System.out.println(i);
}
}
/////////////效率很差的哦,要做多少个循环呀
{
boolean flag=true;
for(int m=2;m<100;m++){
int k = (int)(Math.sqrt(m));
for(int i=2;i<k+1;i++)
if (m%i==0){
flag=false;
break;
}
else flag=true;
if (flag==true){
System.out.println(m);
}
}// end for(m)
}
{
public static void main(String arg[])
{
int k=0;
for(int i=2;i<100;i++){
int j=(int)(Math.sqrt(i))+1;
for(k=2;k<j;k++){
if(i%k==0) break;
}
if(k==j-1) System.out.println(i);
}
}
}
public class prime
{
public static void main(String[] args)
{
for(int i=1; i<100; i++)
{
double sqrt = Math.sqrt(i);
boolean b = true;
for(int j=2; b && j<=sqrt; j++)
{
if(i%j == 0)
b = false;
}
if(b)
System.out.println(i + " 是质数");
} }
}