hdu oj 2734 Quicksum
来源:互联网 发布:红外透视镜软件下载 编辑:程序博客网 时间:2024/05/17 08:20
source: http://acm.hdu.edu.cn/showproblem.php?pid=2734
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3785 Accepted Submission(s): 2760
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
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
//题目 :hdu oj 2734//tag : easy//point:// char c;// (int)c - 64.#include <iostream>#include <cstdio>#include <cstring>using namespace std;int main(){ char c[266]; int sum; while(cin.getline(c, 266) && c[0] != '#'){ sum = 0; for(int i = 0;i < strlen(c);i++) { if(c[i] != ' '){ sum = sum + (i + 1)*((int)c[i] - 64); } } cout << sum << endl; } return 0;}
source: http://acm.hdu.edu.cn/showproblem.php?pid=2734
0 0
- hdu oj 2734 Quicksum
- hdu 2734 Quicksum
- hdu 2734(Quicksum)
- hdu 2734 Quicksum
- HDU.2734 Quicksum
- HDU 2734 Quicksum【水 字符串】
- HDU 2734 Quicksum [Ad Hoc]
- HDU Quicksum
- hdu——2734——Quicksum
- POJ 3094 && HDU 2734 Quicksum(水~)
- 南邮 OJ 1027 Quicksum
- 2734 Quicksum
- hdu 2734 quicksum //简单校验算法
- HDU steps 1.2.5 QuickSum
- ACM道路——Quicksum,OJ 1145
- hd 2734 Quicksum
- 杭电2734 Quicksum
- hdoj 2734 Quicksum(字符串)
- 检查网页(url)重复
- Isomorphic Strings——同构结构判断
- Shell脚本循环读取文件中的每一行
- junit的基本使用
- 利用递归查找链表中与数据成员值与形参n相同的结点
- hdu oj 2734 Quicksum
- 百度定位
- lua全局环境变量_G小结
- 【数据库】Windows下修改MySQL数据库Root密码
- sqli labs 1
- 【深度学习:目标检测】 Face Detection with the Faster R-CNN(数据集标注对比研究报告 )
- android design library提供的TabLayout的用法
- (第2讲)Struts的运行原理及开发流程
- (bean)getIntent().getSerializableExtra()