南邮 OJ 1027 Quicksum
来源:互联网 发布:汉口北淘宝商学院 编辑:程序博客网 时间:2024/05/18 02:04
Quicksum
总提交 : 711 测试通过 : 327
比赛描述
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
输入
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.
输出
For each packet, output its Quicksum on a separate line in the output.
样例输入
ACM
MID CENTRAL
REGIONAL PROGRAMMING CONTEST
ACN
A C M
ABC
BBC
#
样例输出
46
650
4690
49
75
14
15
提示
题目来源
Mid-Central USA Region 2006
#include <iostream>#include <string>using namespace std;int main(){string str;unsigned int i=0;unsigned long Quicksum =0;while(getline(cin,str) && str!="#"){i = 0;Quicksum = 0;while(str[i]){if(str[i]>='A' && str[i]<='Z'){Quicksum += (i+1)*(str[i]-'A'+1);}++i;}cout<<Quicksum<<endl;}}
- 南邮 OJ 1027 Quicksum
- hdu oj 2734 Quicksum
- ACM道路——Quicksum,OJ 1145
- Quicksum
- Quicksum
- QuickSum
- Quicksum
- Quicksum
- Quicksum
- Quicksum
- Quicksum
- Quicksum
- Quicksum
- Quicksum
- Quicksum
- Quicksum
- Quicksum
- Quicksum
- Centos6.5安装PHP运行环境,LNPR安装说明
- oprofile 实践
- 最小费用最大流;HDU1533
- java中的基本数据类型一定存储在栈中的吗?
- openstack keypair实践
- 南邮 OJ 1027 Quicksum
- 一些设计上的基本常识
- 排序
- Centos6.5 x86_64下 静默安装Oracle 11g R2
- 南邮 OJ 1028 Digital Roots
- 微服务实战
- word 转html,pdf转图片
- NGUI界面Drawcall优化
- 8. Document getElementById() 方法