Euler 75

gistfile1.txt

#http://projecteuler.net/problem=75

def generatora(a,b,c):
	if a+b+c <= 1500000:
		global count
		k=1
		while k*(a+b+c) <= 1500000:
			count[k*(a+b+c)]+=1
			k+=1
		aa = a-2*b+2*c
		bb = 2*a-b+2*c
		cc = 2*a-2*b+3*c
		return generatora(aa,bb,cc),generatorb(aa,bb,cc),generatorc(aa,bb,cc)
		
def generatorb(a,b,c):
	if a+b+c <= 1500000:
		global count
		k=1
		while k*(a+b+c) <= 1500000:
			count[k*(a+b+c)]+=1
			k+=1
		aa = a+2*b+2*c
		bb = 2*a+b+2*c
		cc = 2*a+2*b+3*c
		return generatora(aa,bb,cc),generatorb(aa,bb,cc),generatorc(aa,bb,cc)

def generatorc(a,b,c):
	if a+b+c <= 1500000:
		global count
		k=1
		while k*(a+b+c) <= 1500000:
			count[k*(a+b+c)]+=1
			k+=1
		aa = -a+2*b+2*c
		bb = -2*a+b+2*c
		cc = -2*a+2*b+3*c
		return generatora(aa,bb,cc),generatorb(aa,bb,cc),generatorc(aa,bb,cc)

count = [0]*1500001
generatora(3,4,5)
generatorb(3,4,5)
generatorc(3,4,5)
sum=0
for x in range (0,len(count)):
	if count[x]==3:
		sum+=1
print sum