-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathP042.py
More file actions
65 lines (53 loc) · 1.59 KB
/
P042.py
File metadata and controls
65 lines (53 loc) · 1.59 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
57
58
59
60
61
62
63
64
65
# -*- coding: utf-8 -*-
#==============================================================================
# The nth term of the sequence of triangle numbers is given by,
# tn = 0.5 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 = t10. If the word value is a triangle
# number then we shall call the word a triangle word.
#
# Using words.txt (right click and 'Save Link/Target As...'),
# a 16K text file containing nearly two-thousand common
# English words, how many are triangle words?
#==============================================================================
# Define function to import data files obtained from machine
def readfile(filename):
openfile = open(filename, 'rb')
names = openfile.next().split(",")
outname = [name.strip('"') for name in names]
return outname
words = readfile('P042words.txt')
def GetPoints(Word):
Word = Word.upper()
Points = 0
for letter in Word:
Points += ord(letter)-64
return Points
mpts = 0 # Maximim number of points
ptslist = []
for word in words:
pts = GetPoints(word)
ptslist.append(pts)
mpts = pts if (pts>mpts) else mpts
Tri = lambda n : int(0.5*n*(n+1))
Tlist = []
n = 1
Tnext = 0
while Tnext<mpts:
Tnext = Tri(n)
Tlist.append(Tnext)
n += 1
cnt = 0
for pts in ptslist:
try:
Tlist.index(pts)
cnt += 1
except:
pass
print cnt
# 162