def problem_022(file_name="/Users/keith/dev/personal/project_euler/problems/data/problem_022_data.txt"):
"""
Using names.txt (right click and 'Save Link/Target As...'),
a 46K text file containing over five-thousand first names,
begin by sorting it into alphabetical order.
Then working out the alphabetical value for each name,
multiply this value by its alphabetical position in the
list to obtain a name score.
For example, when the list is sorted into alphabetical order,
COLIN, which is worth 3 + 15 + 12 + 9 + 14 = 53, is the 938th
name in the list. So, COLIN would obtain a score of 938 × 53 = 49714.
What is the total of all the name scores in the file?
"""
names = _convert_file_to_array(
file_name,
convert_int=False,
delim_1=",",
delim_2="")
for i in range(0, len(names)):
names[i] = names[i].replace('"', "")
names.sort()
overall_sum = 0
for index, name in enumerate(names):
overall_sum += _get_name_value(name) * (index + 1)
return overall_sum
def problem_018(file_name="/Users/keith/dev/personal/project_euler/problems/data/problem_018_data.txt"):
"""
By starting at the top of the triangle below and moving to
adjacent numbers on the row below, the maximum total from
top to bottom is 23.
3
7 4
2 4 6
8 5 9 3
That is, 3 + 7 + 4 + 9 = 23.
Find the maximum total from top to bottom of the triangle below:
75
95 64
17 47 82
18 35 87 10
20 04 82 47 65
19 01 23 75 03 34
88 02 77 73 07 63 67
99 65 04 28 06 16 70 92
41 41 26 56 83 40 80 70 33
41 48 72 33 47 32 37 16 94 29
53 71 44 65 25 43 91 52 97 51 14
70 11 33 28 77 73 17 78 39 68 17 57
91 71 52 38 17 14 91 43 58 50 27 29 48
63 66 04 68 89 53 67 30 73 16 69 87 40 31
04 62 98 27 23 09 70 98 73 93 38 53 60 04 23
NOTE: As there are only 16384 routes, it is possible to
solve this problem by trying every route. However, Problem 67,
is the same challenge with a triangle containing one-hundred
rows; it cannot be solved by brute force, and requires a
clever method! ;o)
"""
nodes = _convert_file_to_array(file_name)
# nodes = [
# [75],
# [95, 64],
# [17, 47, 82],
# [18, 35, 87, 10],
# [20, 4, 82, 47, 65],
# [19, 1, 23, 75, 3, 34],
# [88, 2, 77, 73, 07, 63, 67],
# [99, 65, 4, 28, 6, 16, 70, 92],
# [41, 41, 26, 56, 83, 40, 80, 70, 33],
# [41, 48, 72, 33, 47, 32, 37, 16, 94, 29],
# [53, 71, 44, 65, 25, 43, 91, 52, 97, 51, 14],
# [70, 11, 33, 28, 77, 73, 17, 78, 39, 68, 17, 57],
# [91, 71, 52, 38, 17, 14, 91, 43, 58, 50, 27, 29, 48],
# [63, 66, 4, 68, 89, 53, 67, 30, 73, 16, 69, 87, 40, 31],
# [4, 62, 98, 27, 23, 9, 70, 98, 73, 93, 38, 53, 60, 04, 23]]
nodes.reverse()
for i in range(0, len(nodes) - 1):
bot_arr = nodes[i]
top_arr = nodes[i + 1]
new_top = []
for j in range(0, len(top_arr)):
if top_arr[j] + bot_arr[j] > top_arr[j] + bot_arr[j + 1]:
new_top.append(top_arr[j] + bot_arr[j])
else:
new_top.append(top_arr[j] + bot_arr[j + 1])
nodes[i + 1] = new_top
return nodes[-1][0]
