Java 质数求和

package test02;

public class Prime {

public static void main(String[] args) {
	
	int sum = 2; // 1 not prime number!!!
	int p = 0;

	for (int i = 3; i <= 1000; i++) {

		for (int j = 2; j < i; j++) {

			p = 0;

			if (i % j == 0) {

				break;

			} else {

				if (j == (i - 1)) {

					p = i;
					

				}

			}

		}
		
		sum = sum + p;
	}

	System.out.println(sum);

}

}