project euler 92

Problem 92

---

Square digit chains

A number chain is created by continuously adding the square of the digits in a number to form a new number until it has been seen before.

For example,

44 → 32 → 13 → 10 → 1 → 1
85 → 89 → 145 → 42 → 20 → 4 → 16 → 37 → 58 → 89

Therefore any chain that arrives at 1 or 89 will become stuck in an endless loop. What is most amazing is that EVERY starting number will eventually arrive at 1 or 89.

How many starting numbers below ten million will arrive at 89?

---

平方数字链

将一个数的所有数字的平方相加得到一个新的数，不断重复直到新的数已经出现过为止，这构成了一条数字链。

例如，

44 → 32 → 13 → 10 → 1 → 1
85 → 89 → 145 → 42 → 20 → 4 → 16 → 37 → 58 → 89

可见，任何一个到达1或89的数字链都会陷入无尽的循环。更令人惊奇的是，从任意数开始，最终都会到达1或89。

有多少个小于一千万的数最终会到达89？

package projecteuler;

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

import junit.framework.TestCase;

public class Prj92 extends TestCase {

	public static final int LIMIT = 10000000;

	public Set<Integer> SET1 = new HashSet<Integer>();
	public Set<Integer> SET89 = new HashSet<Integer>();

	public void testSquareDigitChains() {

		SET1.addAll(Arrays.asList(44, 32, 13, 10, 1));
		SET89.addAll(Arrays.asList(85, 89, 145, 42, 20, 4, 16, 37, 58));

		for (int i = 1; i <= LIMIT; i++) {

			int square = getSquareNum(i);
			if (SET1.contains(square)) {
				SET1.add(i);
			} else if (SET89.contains(square)) {
				SET89.add(i);
			} else {

				List<Integer> dataList = new ArrayList<Integer>();
				dataList.add(i);
				dataList.add(square);
				int tp = square;
				while (true) {

					tp = getSquareNum(tp);
					dataList.add(tp);
					if (tp == 1) {
						SET1.addAll(dataList);
						break;
					}

					if (tp == 89) {
						SET89.addAll(dataList);
						break;
					}

				}
			}

			if (i % 1000000 == 0) {
				System.out.println("i=" + i);
			}
		}

		assertTrue(SET1.size() + SET89.size() == LIMIT);
		System.out.println("num89=" + SET89.size());
		System.out.println("num1=" + SET1.size());

	}

	int getSquareNum(int val) {

		String str = Integer.toString(val);
		int square = 0;
		for (int i = 0; i < str.length(); i++) {
			int v = Integer.parseInt(String.valueOf(str.charAt(i)));
			square += Math.pow(v, 2);
		}
		return square;
	}
}