-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path042.py
More file actions
56 lines (41 loc) · 1.54 KB
/
042.py
File metadata and controls
56 lines (41 loc) · 1.54 KB
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
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
"""
Problem 42
==========
The n^th term of the sequence of triangle numbers is given by, t[n] =
½n(n+1); so the first ten triangle numbers are:
1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...
By converting each letter in a word to a number corresponding to its
alphabetical position and adding these values we form a word value. For
example, the word value for SKY is 19 + 11 + 25 = 55 = t[10]. If the word
value is a triangle number then we shall call the word a triangle word.
Using [1]words.txt, a 16K text file containing nearly two-thousand common
English words, how many are triangle words?
Visible links
1. words.txt
Answer: 82aa4b0af34c2313a562076992e50aa3
"""
import os
from common import check
from itertools import count, takewhile
PROBLEM_NUMBER = 42
ANSWER_HASH = "82aa4b0af34c2313a562076992e50aa3"
FILE_NAME = "p042_words.txt"
file_path = os.path.join(os.path.dirname(__file__), FILE_NAME)
def get_score(word):
return sum((ord(c)-64 for c in word))
triangles = set()
def generate_triangles():
for i in count(1):
t = 0.5 * i * (i + 1)
triangles.add(t)
yield t
generator = generate_triangles()
def is_triangle(n):
for t in takewhile(lambda t: t < n, generator):
pass
return n in triangles
with open(file_path, "r") as file:
line = file.readline()
words = [word.strip("\"") for word in line.strip().split(",")]
result = sum(1 for word in words if is_triangle(get_score(word)))
check(result, PROBLEM_NUMBER, ANSWER_HASH)