java 找出100以内的素数
public class FindPrime {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
int num = 100;
String s = "100以内的素数：";
for (int i = 1; i <= num; i++) {
int count = 0;
for (int j = 1; j <= (int) Math.sqrt(i); j++) {
if (i % j == 0)
count++;
}
if (count > 1)
s += "";
else
s += i + " ";
}
System.out.println(s);
}
//result
//100以内的素数：1 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97
}
相关文档：
import java.sql.Connection;
import java.sql.DatabaseMetaData;
import java.sql.Driver;
import java.sql.DriverManager;
import java.sql.SQLException;
import java.sql.Statement;
import java.util.Enumeration;
import java.util.Vector;
/*虽然现在用APACHE COMMONS DBCP可以非常方便的建立数据库连接池， ......
來源：http://blog.csdn.net/loyoveui/archive/2007/06/22/1662154.aspx
package test;
import java.lang.reflect.Method;
public class InvokeTest {
/**
*
* main 方法
* @param args
* void
*/
public static v ......
//静态块（static block）：如下所示
public class StaticBlock1
{
static
{
System.out.println("static block");
......
先看个例子：
接口
package example;
public interface Basic {
public void hello();
}
接口的实现类
package example;
public class BasicService implements Basic {
public void hello() {
Sysyt ......
