Cacher is the code snippet organizer for pro developers

from fractions import gcd

def euler39better2():
	sum_count = [0] * 1001
	triples_to_check = []
	for a in range(2000/3):
		if a%100 == 0:
			print "|", 
		for b in range((a%2)+1, a+1, 2):
			for c in range(a+1,1001-a-b):
				if a**2 + b**2 == c**2:
					if gcd(a, b) == 1 and gcd(a, c) == 1 and gcd(b, c) == 1:
						for i in range(1, 1000/(a+b+c) + 1):
							sum_count[a*i + b*i + c*i] += 1
	return sum_count.index(max(sum_count))