-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathproblem22.rb
20 lines (15 loc) · 894 Bytes
/
problem22.rb
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
#!/bin/env ruby
require 'benchmark'
<<COMM
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?
COMM
def charvalue char
char.upcase[0] - 64
end
def wordvalue word
word.split(//).inject(0) {|acc, char| acc+= charvalue(char)}
end
names = File.read("names.txt").gsub(/"/,'').split(",").sort
puts names.enum_with_index.inject(0) {|acc, pair| acc += wordvalue(pair.first) * (pair.last + 1) }