[水题][第一阶段-英文题试水][HDOJ-2734]Quicksum
来源:互联网 发布:linux培训上海 编辑:程序博客网 时间:2024/06/05 22:56
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
import java.util.Scanner;public class Main {public static void main(String[] args) {// TODO Auto-generated method stubScanner in = new Scanner(System.in);int i;String str = in.nextLine();char CH = str.charAt(0);while(CH!='#'){ int sum=0;for(i=0;i<str.length();i++){char ch = str.charAt(i);if(ch!=' '){int num = (int)ch-(int)'A'+1;sum+=(i+1)*(num);}}System.out.println(sum);str= in.nextLine(); CH = str.charAt(0);}}}
0 0
- [水题][第一阶段-英文题试水][HDOJ-2734]Quicksum
- [水题][第一阶段-英文题试水][HDOJ-1062]Text Reverse
- [水题][第一阶段-英文题试水][HDOJ-2104]hide handkerchief
- [水题][第一阶段-英文题试水][HDOJ-1064]Financial Management
- hdoj 2734 Quicksum(字符串)
- HDOJ 2734 Quicksum
- 元旦假期归来~[水题][第一阶段-英文题试水][HDOJ-1170]Balloon Comes!
- 元旦假期归来~[水题][第一阶段-英文题试水][HDOJ-1197]Specialized Four-Digit Numbers
- 元旦假期归来~[水题][第一阶段-英文题试水][HDOJ-2629]Identity Card
- hdoj 2734 Quicksum 水过~
- [水题][第一阶段-简单操作][HDOJ-2039]三角形
- 2734 Quicksum
- [水题][第一阶段-输出输出][HDOJ-1001]Sum Problem
- [水题][第一阶段-简单操作][HDOJ-2000]ASCII码排序
- [水题][第一阶段-简单操作][HDOJ-2002]计算球体积
- [水题][第一阶段-简单操作][HDOJ-2003]求绝对值
- [水题][第一阶段-简单操作][HDOJ-2004]成绩转换
- [水题][第一阶段-简单操作][HDOJ-2005]第几天?
- ZooKeeper典型使用场景一览
- 南京地图
- 字符串加解密
- Perl 去掉行分割符
- 【Objective-C】06-点语法
- [水题][第一阶段-英文题试水][HDOJ-2734]Quicksum
- Android生成二维码图片
- [LeetCode] Binary Tree Maximum Path Sum
- iOS 8 AutoLayout与Size Class自悟
- duplicate symbols for architecture armv7错误
- Android ANT 多渠道打包解决方案
- 2014年总结
- android中的 AlertDialog的个人见解
- 【session内部机制】PHP的session_set_save_handler 执行机制