Euler 12需要优化

import math

def get_factors_count(n):
    count = 0
    sqrt_n = int(math.sqrt(n))
    for i in range(1, sqrt_n+1):
        if n % i == 0:
            count += 2
    if sqrt_n * sqrt_n == n:
        count -= 1
    return count

def find_triangle_number_with_factors(factor_count):
    triangle_number = 0
    n = 1
    while True:
        triangle_number += n
        factors_count = get_factors_count(triangle_number)
        if factors_count > factor_count:
            return triangle_number
        n += 1

result = find_triangle_number_with_factors(500)
print("第一个具有超过500个因子的三角形数是：", result)