ACM道路——Quicksum,OJ 1145
来源:互联网 发布:web前端和java 编辑:程序博客网 时间:2024/04/30 22:59
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 = 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
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
HINT
Source
Mid-Central USA 2006
#include <stdio.h> int main(void) { char c; int sum = 0,pos = 1; while(1) { c = getchar(); if(c == '#') break; else if (c == '\n') { printf("%d\n",sum); sum = 0; pos = 1; continue; } else { sum += (c == ' ') ? 0 : pos*(c - 'A' + 1); pos++; } } return 0; }
- ACM道路——Quicksum,OJ 1145
- 繁杂的道路 南邮ACM OJ 1160
- 南邮 OJ 1027 Quicksum
- hdu oj 2734 Quicksum
- ACM试题学习--QuickSum
- 北大ACM 3094 Quicksum
- ACM steps quicksum
- 杭电ACM 2734: Quicksum
- hdu——2734——Quicksum
- ACM--steps--dyx--1.2.6--Quicksum
- Quicksum
- Quicksum
- QuickSum
- Quicksum
- Quicksum
- Quicksum
- Quicksum
- Quicksum
- 候机厅里,68万元的手机不见了
- java版本_二叉树
- Unix网络编程第三版源码编译
- IOS
- ARM交叉编译工具制作V2
- ACM道路——Quicksum,OJ 1145
- Android软件开发之在程序中时时获取logcat日志信息
- javaProject打包和服务发布解决方案
- 如何在 KVM 虚拟机上运行 KVM
- 计算机视觉、模式识别、机器学习常用牛人主页链接
- SVN错误:SVN Working copy XXX is too old
- awk学习
- FastCgi 与 PHP-FPM 之间的区别
- Android UI系统控件进阶(三)—自动完成文本控件AutoCompleteTextView详解及属性