ZOJ 2812 Quicksum

Quicksum

Time Limit: 2 Seconds
Memory Limit: 65536 KB

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.

[thead]
[/thead]

Example Input:	Example Output:
ACM MID CENTRAL REGIONAL PROGRAMMING CONTEST ACN A C M ABC BBC #	46 650 4690 49 75 14 15

题意：
求计算一行字符串的Quicksum,就是指一行字符串中每个字符的位置与该字符的值的成绩相加的结果。
一行字符串的位置由1开始计数，空格也占一个位置。A~Z的值对应为1~26，空格的值为0。

#include <iostream>
using namespace std;

int main()
{
	char s[256];
	int sum;
	int i;
	while(cin.getline(s,255))
	{
		if(s[0] =='#') break;
		sum = 0;
		for(i = 0; s[i]; i++)
			if(s[i]!=' ')
				sum +=(s[i]-'A'+1)*(i+1);
		cout<<sum<<endl;
	}
	return 0;
}