project euler 60

Problem 60

---

Prime pair sets

The primes 3, 7, 109, and 673, are quite remarkable. By taking any two primes and concatenating them in any order the result will always be prime. For example, taking 7 and 109, both 7109 and 1097 are prime. The sum of these four primes, 792, represents the lowest sum for a set of four primes with this property.

Find the lowest sum for a set of five primes for which any two primes concatenate to produce another prime.

---

素数对的集合

3、7、109和673是非常特别的一组素数。任取其中的两个并且以任意顺序连接起来，其结果仍然是个素数。例如，选择7和109，我们得到7109和1097均为素数。这四个素数的和是792，这是满足这个性质的一组四个素数的最小和。

若有一组五个素数，任取其中的两个并且以任意顺序连接起来，其结果仍然是个素数，求这样一组素数的最小和。

package projecteuler;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

import junit.framework.TestCase;

public class Prj60 extends TestCase {

	public static int UP_LIMIT = 10000;
	public static int NUM_OF_COUNT = 5;

	/**
	 * 暴力法，未证明最小
	 */
	public void testPrimePairSets() {

		DfsPrimePairSets dfsP = new DfsPrimePairSets();
		dfsP.doTest();
	}

	public static class PrimePairSetsTestCase {
		public int n;
		public long[] data;

		public PrimePairSetsTestCase(int n) {
			super();
			this.n = n;
			data = new long[n];
		}

		public void setValue(int id, int val) {
			data[id] = val;
		}

		public long[] getResult() {
			return Arrays.copyOf(data, data.length);
		}

		public boolean isOutOfBoundary(int id) {
			return id >= data.length;
		}

		public boolean isFind() {
			for (int i = 0; i < data.length; i++) {
				for (int j = 0; j < data.length; j++) {
					if (i == j) {
						continue;
					} else {
						Long lf = concatInt(data[i], data[j]);
						Long rt = concatInt(data[j], data[i]);
						if (!isPrime(lf) || !isPrime(rt)) {
							return false;
						}
					}
				}
			}

			return true;
		}

		public boolean isValid(int id, int val) {
			if (id == 0) {
				return true;
			}

			if (data[id - 1] > val) {
				return false;
			}

			if (data[0] != 3) {
				if ((data[0] % 3) != (val % 3)) {
					return false;
				}
			}

			long[] copy = Arrays.copyOf(data, data.length);
			for (int i = 0; i < id; i++) {
				Long lf = concatInt(copy[i], val);
				Long rt = concatInt(val, copy[i]);
				if (!isPrime(lf) || !isPrime(rt)) {
					return false;
				}
			}

			return true;
		}

		public void printResult() {
			for (int i = 0; i < data.length; i++) {
				System.out.print(data[i] + ",");
			}
			System.out.println();
		}
	}

	public static class DfsPrimePairSets {

		public List<int[]> localMin = new ArrayList<int[]>();

		public void doTest() {
			List<Integer> primeList = new ArrayList<Integer>();
			for (int i = 2; i <= UP_LIMIT; i++) {
				if (isPrime((long) i)) {
					primeList.add(i);
				}
			}

			PrimePairSetsTestCase ts = new PrimePairSetsTestCase(NUM_OF_COUNT);

			List<long[]> rs = new ArrayList<long[]>();
			dfs(0, ts, primeList, rs);

			long minSum = Long.MAX_VALUE;
			int minId = -1;
			for (int i = 0; i < rs.size(); i++) {
				long[] arr = rs.get(i);
				if (sumArr(arr) < minSum) {
					minSum = sumArr(arr);
					minId = i;
				}
			}

			if (minId != -1) {
				long[] arr = rs.get(minId);
				for (int i = 0; i < arr.length; i++) {
					System.out.print(arr[i] + ",");
				}
				System.out.println();
				System.out.println("sum=" + minSum);
			}
		}

		private long sumArr(long[] arr) {

			int sum = 0;
			for (int i = 0; i < arr.length; i++) {
				sum += arr[i];
			}
			return sum;
		}

		public void dfs(int startIndex, PrimePairSetsTestCase ts,
				List<Integer> primeList, List<long[]> rs) {

			if (ts.isOutOfBoundary(startIndex)) {
				if (ts.isFind()) {
					rs.add(ts.getResult());
					ts.printResult();
				}
				return;
			}

			for (int i = 0; i < primeList.size(); i++) {

				int setVal = primeList.get(i);
				if (ts.isValid(startIndex, setVal)) {
					ts.setValue(startIndex, setVal);
					dfs(startIndex + 1, ts, primeList, rs);
				}
			}

		}
	}

	public static long concatInt(long lf, long rt) {
		String val = Long.toString(lf, 10) + Long.toString(rt);
		return Long.parseLong(val);
	}

	public static boolean isPrime(Long val) {
		assert (val >= 1);

		if (val <= 10) {
			if (val == 2 || val == 3 || val == 5 || val == 7) {
				return true;
			}
			return false;
		}

		if (val % 2 == 0) {
			return false;
		}

		for (int i = 3; i * i <= val; i += 2) {
			if (val % i == 0) {
				return false;
			}
		}

		return true;
	}

}