ACMSTEP 1.2.3 QuickSum //超级水题 模拟
2011-08-08 09:46
549 查看
原题网址
[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]
[align=left]Sample Output[/align]
Quicksum
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 509 Accepted Submission(s): 381[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
#include <iostream> #include <cstdio> #include <cstring> #include <cmath> #include <cstdlib> #include <cctype> #include <string> #include <vector> #include <queue> #include <algorithm> using namespace std; int main() { char str[300]; int len , sum , i, j; while (gets(str)) { if(!strcmp(str,"#")) break; sum = 0; len = strlen(str); for (i=1; i<=len; i++) { if (isalpha(str[i-1])) sum += i*(str[i-1]-'A'+1); } cout<<sum<<endl; } return 0; }
相关文章推荐
- hdu ACM step 1.2.3 hdu1064
- ACMSTEP 1.2.7 Specialized Four-Digit Numbers //水题 模拟 进制转换
- 航电ACM step1.2.3 Box of bricks
- HDU acmstep 1.2.3 text reverse
- ACM STEP 1.2.3 Nasty Hacks
- ACM step 1.2.3 hide handkerchief
- ACMSTEP 1.2.5 IBM Minus One//超级水题
- ACMSTEP 3.1.1 超级楼梯 //递推 斐波那契数列
- ACMSTEP 1.2.4 ecimal System //水题 模拟 活用Sprintf和sscanf
- [EXCEL][STEP BY STEP]使用超级连接进行数据查询
- 杭电 ACM Step(3)
- 【模拟】NEERC15 E Easy Problemset (2015-2016 ACM-ICPC)(Codeforces GYM 100851)
- ACM 48. [NOIP2007] 字符串的展开(水模拟)
- [ACM_模拟] POJ1068 Parencodings (两种括号编码转化 规律 模拟)
- 第八届acm省赛 A挑战密室(模拟)
- ACM-ICPC北京赛区2017网络同步赛 题目5 : Cats and Fish【模拟】
- [ACM_模拟][ACM_暴力] Lazier Salesgirl [暴力 懒销售睡觉]
- HDU 1278 漂亮面料的设计(超级模拟)
- HDU ACM—STEP 3.3.7二维背包
- ACM--虫子爬井--模拟--HDOJ 1049--Climbing Worm--水