Workings & Source for Project Euler solutions
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 

31 lines
592 B

def gridToTriangle(x,y):
sumOfTriangle=0
for i in range(x):
for o in range(y):
sumOfTriangle+=(x-i)*(y-o)
return(sumOfTriangle)
solved=False
sizeOfTriangle=1
closestGuy=[0,0]
difference=99999999
answer=0
while not(solved):
sizeOfTriangle+=1
for i in range(sizeOfTriangle):
tempAns=gridToTriangle(i+1,sizeOfTriangle)
tempDiff=abs(2000000-tempAns)
if tempDiff<difference:
closestGuy=[i+1,sizeOfTriangle]
difference=tempDiff
answer=tempAns
if tempDiff>200000000:
solved=True
if sizeOfTriangle%100==0:
print(sizeOfTriangle)
print(closestGuy)
print(answer)