https://projecteuler.net/problem=12

最新推荐文章于 2016-04-27 22:14:11 发布

csdn_user_gsz

最新推荐文章于 2016-04-27 22:14:11 发布

阅读量306

点赞数

分类专栏：算法练习

本文链接：https://blog.csdn.net/csdn_user_gsz/article/details/50770559

版权

算法练习专栏收录该内容

26 篇文章 0 订阅

订阅专栏

Highly divisible triangular number

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?

现在是一个一个去算，以后看看有没有好的数学方法，去算这个问题。算法说到底还是数学问题。

from math import sqrt
def firTriangleNumber():
    start = 1
    divisorNum = 500
    while True:
        if allDivisorNum(TriangleNumber(start)) > 500:
            return TriangleNumber(start)
        start += 1

def allDivisorNum(n):
    count = 0
    start = 1
    end = int(sqrt(n))
    if end <= 250:return 0
    while start <= end:
        if n % start == 0:
            count += 2
        start += 1
    if n / end == end:
        count -= 1
    return count

def TriangleNumber(n):
    return n * (n+1) / 2

print(firTriangleNumber())