题解|等差素数组

import java.util.ArrayList;
import java.util.Scanner;

public class 等差素数组 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		while (sc.hasNext()) {
			int n = sc.nextInt();
			ArrayList<Integer> list = new ArrayList<>();
			int length = 10000;// 控制好数据规模,在2-10000中筛选素数
			int[] flag = new int[length + 1];
			for (int i = 2; i <= length; i++) {
				if (isPrime(i)) {
					for (int j = i + 1; j <= length; j++) {
						if (j % i == 0) {
							flag[j] = 1;
						}
					}
				}
			}
			for (int i = 2; i < flag.length; i++) {
				// 0保留，1去除
				if (flag[i] == 0) {
					list.add(i);
				}
			}
			// 在list中寻找n个等差素数
			l1: for (int d = 1; d < 1000; d++) {
				l2: for (int i = 0; i < list.size(); i++) {
					for (int j = 1; j < n; j++) {
						int num1 = list.get(i);
						int num = list.get(i) + j * d;
						if (!list.contains(num)) {
							continue l2;
						}
					}
					System.out.println(d);
					break l1;// 只输出一组
				}
			}
		}
	}

	private static boolean isPrime(int num) {
		for (int i = 2; i < num; i++) {
			if (num % i == 0) {
				return false;
			}
		}
		return true;
	}

}