forked from nayuki/Project-Euler-solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathp012.py
More file actions
32 lines (25 loc) · 721 Bytes
/
p012.py
File metadata and controls
32 lines (25 loc) · 721 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
#
# Solution to Project Euler problem 12
# Copyright (c) Project Nayuki. All rights reserved.
#
# https://www.nayuki.io/page/project-euler-solutions
# https://github.com/nayuki/Project-Euler-solutions
#
import eulerlib, itertools
def compute():
triangle = 0
for i in itertools.count(1):
triangle += i # This is the ith triangle number, i.e. num = 1 + 2 + ... + i = i * (i + 1) / 2
if num_divisors(triangle) > 500:
return str(triangle)
# Returns the number of integers in the range [1, n] that divide n.
def num_divisors(n):
end = eulerlib.sqrt(n)
result = sum(2
for i in range(1, end + 1)
if n % i == 0)
if end**2 == n:
result -= 1
return result
if __name__ == "__main__":
print(compute())