mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-24 13:31:07 +00:00
Solution to Problem 22
This commit is contained in:
parent
6abab54c2b
commit
a5f0ae84ea
1
Project Euler/Problem 22/p022_names.txt
Normal file
1
Project Euler/Problem 22/p022_names.txt
Normal file
File diff suppressed because one or more lines are too long
37
Project Euler/Problem 22/sol1.py
Normal file
37
Project Euler/Problem 22/sol1.py
Normal file
|
@ -0,0 +1,37 @@
|
||||||
|
# -*- coding: latin-1 -*-
|
||||||
|
from __future__ import print_function
|
||||||
|
'''
|
||||||
|
Name scores
|
||||||
|
Problem 22
|
||||||
|
|
||||||
|
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?
|
||||||
|
'''
|
||||||
|
try:
|
||||||
|
xrange #Python 2
|
||||||
|
except NameError:
|
||||||
|
xrange = range #Python 3
|
||||||
|
|
||||||
|
with open('p022_names.txt') as file:
|
||||||
|
names = str(file.readlines()[0])
|
||||||
|
names = names.replace('"', '').split(',')
|
||||||
|
|
||||||
|
names.sort()
|
||||||
|
|
||||||
|
name_score = 0
|
||||||
|
total_score = 0
|
||||||
|
|
||||||
|
for i, name in enumerate(names):
|
||||||
|
for letter in name:
|
||||||
|
name_score += ord(letter) - 64
|
||||||
|
|
||||||
|
total_score += (i+1)*name_score
|
||||||
|
name_score = 0
|
||||||
|
|
||||||
|
print(total_score)
|
Loading…
Reference in New Issue
Block a user