TopCoder

User's AC Ratio

NaN% (0/0)

Submission's AC Ratio

NaN% (0/0)

Tags

Description

If we define each of the upper case letters a number, that is, 1 for A, 2 for B, 3 for C, ... 25 for Y, 26 for Z, we can calculate a mark for any word or sentence.

We believe that 100 points is the full mark, so for those word with a mark larger than 100, we should just ignore that, with a label "INVALID". Then lets see interesting results:

What is the most important for your success?

  • HARD WORK? H+A+R+D+W+O+R+K=8+1+18+4+23+15+18+11=98
  • KNOWLEDGE? K+N+O+W+L+E+D+G+E=11+14+15+23+12+5+4+7+5=96
  • MONEY?(72)
  • LUCK?(47)
  • ATTITUDE! A+T+T+I+T+U+D+E=1+20+20+9+20+21+4+5=100

So just be with good attitude and you will be on your way to success.

Input Format

For each case of the input, it contains a single line. For each line, some characters will appear with maybe some of them being upper case letters. All characters are printable. Each line will have at most 127 characters.

Output Format

For each case, you should only pay attention to upper case letters and calculate the total points. If it is over 100, "INVALID" should be returned. Or you should print the exact point of that.

Sample Input 1

DELICIOUS FOOD
YY, and YY again!
did i lose anything?

Sample Output 1

INVALID
100
0

Hints

Problem Source

Migrated from old NTUJ.

2009Harbin

Subtasks

No. Testdata Range Score

Testdata and Limits

No. Time Limit (ms) Memory Limit (VSS, KiB) Output Limit (KiB) Subtasks
0 10000 65536 200