findprimes.java

一些很简单的JAVA代码,一些人可以用上的

public class FindPrimes {
  public static void main(String[] args) {
    int nPrimes = 50;                  // The maximum number of primes required

    OuterLoop:
    for(int i = 2; ; i++) {            // This loop runs forever

      // Try dividing by all integers from 2 to i-1
      for(int j = 2; j < i; j++) {
        if(i % j == 0) {               // This is true if j divides exactly
          continue OuterLoop;          // so exit the loop
        }
      }
      // We only get here if we have a prime
      System.out.println(i);           // so output the value
      if(--nPrimes == 0) {             // Decrement the prime count
        break;                         // It is zero so we have them all
      }
    }
  }
}