Question
Programming Challenge Description: When John was a little kid he didn't have much to do. There was no internet, no Facebook, and no programs to
Programming Challenge Description:
When John was a little kid he didn't have much to do. There was no internet, no Facebook, and no programs to hack on. So he did the only thing he could... he evaluated the beauty of strings in a quest to discover the most beautiful string in the world. Given a string s, little Johnny defined the beauty of the string as the sum of the beauty of the letters in it. The beauty of each letter is an integer between 1 and 26, inclusive, and no two letters have the same beauty. Johnny doesn't care about whether letters are uppercase or lowercase, so that doesn't affect the beauty of a letter. (Uppercase 'F' is exactly as beautiful as lowercase 'f', for example.) You're a student writing a report on the youth of this famous hacker. You found the string that Johnny considered most beautiful. What is the maximum possible beauty of this string?
Input:
Your program should read lines from standard input. Each line is a string.
Output:
Print out the maximum beauty for the string.
Test 1
Test Input
Download Test Input
ABbCcc
Expected Output
Download Test Output
152
152
Test 2
Test Input
Download Test Input
Ignore punctuation, please :)
Expected Output
Download Test Output
491
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started