HDU 2734 Quicksum【水 字符串】
来源:互联网 发布:淘宝卖家客服电话热线 编辑:程序博客网 时间:2024/06/07 08:21
Quicksum
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3121 Accepted Submission(s): 2300
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
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
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(){char s[1005];while(gets(s),s[0]!='#'){long long sum=0;for(int i=0;s[i];++i){if(s[i]!=' '){sum+=(s[i]-'A'+1)*(i+1);}}printf("%lld\n",sum);}return 0;}
0 0
- HDU 2734 Quicksum【水 字符串】
- hdoj 2734 Quicksum(字符串)
- POJ 3094 && HDU 2734 Quicksum(水~)
- hdu 2734 Quicksum
- hdu 2734(Quicksum)
- hdu 2734 Quicksum
- HDU.2734 Quicksum
- hdu oj 2734 Quicksum
- HDU 2734 Quicksum [Ad Hoc]
- HDU Quicksum
- hdu——2734——Quicksum
- hdoj 2734 Quicksum 水过~
- 2734 Quicksum
- Quicksum(字符串基础)
- hdu 2734 quicksum //简单校验算法
- HDU steps 1.2.5 QuickSum
- hd 2734 Quicksum
- 杭电2734 Quicksum
- 全面解析Linux 内核 3.10.x - 启动1号进程
- 串口通信数据格式那点儿事儿
- 仿网易新闻的页面(ViewPager作为RecyclerView的Header)
- mysql特殊运算符
- OpenGL入门学习
- HDU 2734 Quicksum【水 字符串】
- 这16家创业公司没有影响到你,你可能OUT了
- 汽车功能安全ISO 26262介绍
- 杭电-5563-一般
- JS基本知识点
- c++里的指数、对数等
- cocoapods配置
- android wearable-Creating Custom Layouts
- 杭电-5522