mod2ans.lst

来自「Mcgraw-Hill - Java 2 - A Beginner S Guid」· LST 代码 · 共 23 行

listing 1
// Find prime numbers between 1 and 100. 
class Prime {    
  public static void main(String args[]) {    
    int i, j; 
    boolean isprime; 
 
    for(i=1; i < 100; i++) { 
      isprime = true;  
 
      // see if the number is evenly divisible 
      for(j=2; j <= i/2; j++) 
        // if it is, then its not prime 
        if((i%j) == 0) isprime = false; 
 
      if(isprime) 
        System.out.println(i + " is prime."); 
    } 
  }    
}