Project Euler Problem 12

Problem 12

The sequence of triangle numbers is generated by adding the natural numbers. So the 7^th triangle number would be 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28. The first ten terms would be:

1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...

Let us list the factors of the first seven triangle numbers:

 1: 1
 3: 1,3
 6: 1,2,3,6
10: 1,2,5,10
15: 1,3,5,15
21: 1,3,7,21
28: 1,2,4,7,14,28

We can see that 28 is the first triangle number to have over five divisors.

What is the value of the first triangle number to have over five hundred divisors?

# 求第一个拥有超过500个因数的三角数。

def factor_nums(n):
    factors_num = 0
    for i in range(1,int(n**0.5)+1):
        if n % i == 0:
            factors_num += 1
    return factors_num

i = 1
sum1 = 0
while True:
    sum1 += i
    t = factor_nums(sum1)
    if t > 250:
        print(i,sum1)
        print(2*t)
        break
    i += 1

说明：因为因数都是成对的，只需要找到sqrt(n)内的因数，判断超过250就可以了。

结果：76576500