杭电 acm 2734 Quicksum
2018-01-28 10:04
351 查看
Quicksum
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4650 Accepted Submission(s): 3335
[align=left]Problem Description[/align]
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
[align=left]Input[/align]
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.
[align=left]Output[/align]
For each packet, output its Quicksum on a separate line in the output.
[align=left]Sample Input[/align]
ACM
MID CENTRAL
REGIONAL PROGRAMMING CONTEST
ACN
A C M
ABC
BBC
#
[align=left]Sample Output[/align]
46
650
4690
49
75
14
15
主要用到getline(cin)输入,还有size函数看输入string长度,然后因为是ABCD.....所以直接将其减去64累加就行了,遇到空格就加0就OK.
#include<string> #include<iostream> using namespace std; int main() { string s; while (getline(cin, s) && s != "#") { int sum=0,length = s.size(); for (int i = 0; i < length; i++) { if (s[i] == ' ') { sum += 0; } else sum += ((i + 1)*(s[i]-64)); } cout << sum<<endl; } return 0; }
相关文章推荐
- 杭电ACM 2734: Quicksum
- 杭电2734QuickSum
- 杭电ACM 1000题
- ACM杭电的AC回顾
- ACM杭电的AC回顾——2029
- HDU 2734 Quicksum [Ad Hoc]
- 杭电ACM 第1094题
- 杭电ACM 1022--Train Problem
- 杭电ACM 第2006题
- 北大ACM 3094 Quicksum
- 杭电ACM 第2023题
- 杭电acm1019 hdu-acm-101解题报告
- 杭电ACM 第2041题
- 杭电ACM 第2057题
- 杭电 HDU ACM Milk
- 杭电ACM 第2085题
- 杭电acm 1002
- 杭电 acm 2029 Palindromes _easy version
- 杭电ACm求数列的和2009
- 杭电ACM 2092:整数解