水222

#include<iostream>using namespace std;int pao(char aa){    if(aa=='A')    {        return 1;    }    if(aa=='B')    {        return 2;    }    if(aa=='C')    {        return 3;    }    if(aa=='D')    {        return 4;    }    if(aa=='E')    {        return 5;    }    if(aa=='F')    {        return 6;    }    if(aa=='G')    {        return 7;    }    if(aa=='H')    {        return 8;    }    if(aa=='I')    {        return 9;    }    if(aa=='J')    {        return 10;    }    if(aa=='K')    {        return 11;    }    if(aa=='L')    {        return 12;    }    if(aa=='M')    {        return 13;    }    if(aa=='N')    {        return 14;    }    if(aa=='O')    {        return 15;    }    if(aa=='P')    {        return 16;    }    if(aa=='Q')    {        return 17;    }    if(aa=='R')    {        return 18;    }    if(aa=='S')    {        return 19;    }    if(aa=='T')    {        return 20;    }    if(aa=='U')    {        return 21;    }    if(aa=='V')    {        return 22;    }    if(aa=='W')    {        return 23;    }    if(aa=='X')    {        return 24;    }    if(aa=='Y')    {        return 25;    }    if(aa=='Z')    {        return 26;    }}    int main()    {        char x;        int sum;        sum=0;        int k;        k=1;        while(cin.get(x)&&x!='#')        {             if(x=='\n')            {                cout<<sum<<endl;                sum=0;                k=1;                continue;            }            if(x!=' ')            {                sum=sum+pao(x)*k;            }            k++;        }        return 0;    }

Quicksum

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3298 Accepted Submission(s): 2032 

Problem Description

A checksum is an algorithm that scans a packet of data and returns a single number. The idea is that if the packet is changed, the checksum will also change, so checksums are often used for detecting transmission errors, validating document contents, and in many other situations where it is necessary to detect undesirable changes in data.

For this problem, you will implement a checksum algorithm called Quicksum. A Quicksum packet allows only uppercase letters and spaces. It always begins and ends with an uppercase letter. Otherwise, spaces and letters can occur in any combination, including consecutive spaces.

A Quicksum is the sum of the products of each character's position in the packet times the character's value. A space has a value of zero, while letters have a value equal to their position in the alphabet. So, A=1, B=2, etc., through Z=26. Here are example Quicksum calculations for the packets "ACM" and "MID CENTRAL":

ACM: 1*1 + 2*3 + 3*13 = 46MID CENTRAL: 1*13 + 2*9 + 3*4 + 4*0 + 5*3 + 6*5 + 7*14 + 8*20 + 9*18 + 10*1 + 11*12 = 650

 

Input

The input consists of one or more packets followed by a line containing only # that signals the end of the input. Each packet is on a line by itself, does not begin or end with a space, and contains from 1 to 255 characters.

 

Output

For each packet, output its Quicksum on a separate line in the output.

 

Sample Input

ACMMID CENTRALREGIONAL PROGRAMMING CONTESTACNA C MABCBBC#

 

Sample Output

46650469049751415