jakedobkin · December 31, 2011 23:38 · jakedobkin · Jan 2, 2012 · djacobs · Jan 2, 2012
diff --git a/gistfile1.txt b/gistfile1.txt
 # http://projecteuler.net/problem=92
 # this version takes advantage of the fact that all numbers up to 10MM have roundfadds < 600
 # so first compute those, then check them for each number from 1 to 10MM
 # that shaves it from 6 minutes to 120s 

 def fadd(n):
 	sum = 0
 	for i in range (0,len(str(n))):
 		sum += int(str(n)[i:i+1])**2
 	return sum

 def roundfadd(n):
 	if array[n] != 0:
 		return array[n]
 	if fadd(n) == 1:
 		return 1
 	elif fadd(n) == 89:
 		return 89
 	else:
 		return roundfadd(fadd(n))

 array = [0]*600
 for x in range (1,600):
 	array[x]=roundfadd(x)

 top = 10000000
 count = 0 
 for r in range (1,top):
 	if array[fadd(r)] == 89:
 		count += 1
 print count
	# http://projecteuler.net/problem=92
	# this version takes advantage of the fact that all numbers up to 10MM have roundfadds < 600
	# so first compute those, then check them for each number from 1 to 10MM
	# that shaves it from 6 minutes to 120s

	def fadd(n):
	sum = 0
	for i in range (0,len(str(n))):
	sum += int(str(n)[i:i+1])**2
	return sum

	def roundfadd(n):
	if array[n] != 0:
	return array[n]
	if fadd(n) == 1:
	return 1
	elif fadd(n) == 89:
	return 89
	else:
	return roundfadd(fadd(n))

	array = [0]*600
	for x in range (1,600):
	array[x]=roundfadd(x)

	top = 10000000
	count = 0
	for r in range (1,top):
	if array[fadd(r)] == 89:
	count += 1
	print count