poj 3094 Quicksum

来源:互联网 发布:淘宝主播化妆品靠谱吗 编辑:程序博客网 时间:2024/05/19 20:47

Quicksum

Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9536 Accepted: 6638

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 = 46

MID 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
方法:

#include<stdio.h>

int main()
{
    int i,sum;
    char ch[255];
    gets(ch);
    while(ch[0] != '#')//也可以这样写while(gets(ch),ch[0] != '#'),这样看起来更舒服。
    {
        sum = 0;
        for(i = 0 ; ch[i] ; i++)//结束标志的设置,ch[]的最后自动添加"\0"
        {
            if(ch[i] >= 65 && ch[i] < 97)
                sum += (ch[i] - 64)*(i+1);
            else if(ch[i] >= 97 && ch[i] <123)
                sum += (ch[i] - 96)*(i+1);
            else
                sum += 0;
        }
        printf("%d\n",sum);
        gets(ch);
    }
    return 0;
}

原创粉丝点击