?? findprimes.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
}
}
}
?? 快捷鍵說明
復制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號
Ctrl + =
減小字號
Ctrl + -