字符串处理 HDOJ Quicksum
2013-09-11 14:11
525 查看
Quicksum |
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) |
Total Submission(s): 1591 Accepted Submission(s): 1046 |
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 |
[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. |
Sample Input |
Sample Output |
') sum+=((int)(c[i]-'A'+1))*(i+1); } printf("%d\n",sum); } return 0;}
相关文章推荐
- js 关于中文字符串的一些处理
- VBA 处理字符串
- ORACLE 字符串处理函数
- hdoj 3849 By Recognizing These Guys, We Find Social Networks Useful【双连通分量求桥&&输出桥&&字符串处理】
- PHP 字符串处理
- Delphi 自定义消息 处理字符串
- Identity Card   hdoj    2629
- HDOJ  1181    变形课
- HDOJ   2072   单词数
- pythong中" "的编码和解码处理
- 36th成都区域赛网络赛 hdoj4039 The Social Network(建图+字符串处理)
- HDOJ  2700   Parity
- HDOJ   2544   最短路
- HDOJ  2000   ASCII码排序
- HDOJ 2503    a/b + c/d
- HDOJ  2031   进制转换
- HDOJ  4312   Meeting point-2
- HDOJ  4334   Trouble
- HDOJ 1242   Rescue
- UNIX shell 字符串截取实例!!