Project Euler 92

Square digit chains

Problem 92

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?

0.57s，重复组合数什么的。（F 的 120s 真的太彪悍了。）

import itertools
import time

def conquer():
    ans = 0
    DIGIT_LIMIT = 7
    ITER_STR = "0123456789"
    sum_square = lambda ss: sum( int( s ) ** 2 for s in str( ss ) )
    fact = lambda num: reduce( lambda x, y: x * y, xrange( 1, num + 1 ) )
    combinations = itertools.combinations_with_replacement( ITER_STR, DIGIT_LIMIT )
    
    def combinatorial_num( num ):
        res = fact( DIGIT_LIMIT )
        s = str( num )
        for ss in ITER_STR:
            count = s.count( ss )
            if count > 1: res /= fact( count )
        return res
    
    for c in combinations:
        num = int( "".join( c ) )
        if num == 0: continue
        while num != 89 and num != 1:
            num = sum_square( num )
        if num == 89:
            ans += combinatorial_num( c )

    print ans

begin = time.time()
conquer()
end = time.time()
print end - begin