Euler 39 Python

gistfile1.txt

# initialize an array to hold results
l=[0]*1001

# brute force to calculate a,b,c
for a in range(1,1000):
	for b in range(1,1000): 
		c = (a**2 + b**2)**0.5

# verify c is a perfect square and p is < 1000, if it is, increment count
		if (a+b+c<=1000 and c-round(c,0)==0):
			p = int(a + b + c);
			l[p]+=1;
			
# print the largest p with the number of combos
max = 0
for i in range (1,1000):
	if l[i] > max:
		max = l[i]
		max_p = i

print max_p, max