HDU steps 1.2.5 QuickSum
2014-10-22 20:32
113 查看
Quicksum |
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) |
Total Submission(s): 2437 Accepted Submission(s): 1535 |
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 InputACM MID CENTRAL REGIONAL PROGRAMMING CONTEST ACN A C M ABC BBC # |
Sample Output46 650 4690 49 75 14 15 |
Source Mid-Central USA 2006 |
Recommend teddy |
import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); String s = in.nextLine(); while(!s.equals("#")){ int ans = 0; for(int i=0;i<s.length();i++){ if(s.charAt(i) == ' ') continue; ans += (i+1)* (int)( s.charAt(i)-'A'+1); } System.out.println(ans); s = in.nextLine(); } } }
相关文章推荐
- Quicksum
- USACO 1.2.5 Dual Palindromes (dualpal)
- zlib 1.2.5 编译 ( VS2010 )(
- mmseg 1.2.5 : Python Package Index
- zoj2812-----------------Quicksum
- USACO1.2.5 Dual Palindromes(双重回文数)
- Quicksum(字符串基础)
- USACO 1.2.5 Dual Palindromes
- C++程序设计实践学材系列(13)——1.2.5 选择Code::Blocks的理由
- hdu2262 Quicksum
- hdoj 2734 Quicksum 水过~
- HDU 1.2.5 IBM Minus One
- Olex2 1.2.5 【分享】
- 南邮 OJ 1027 Quicksum
- 2. Spring Boot 1.2.5 不允许加载iframe问题解决
- 1.2.5
- USACO 1.2.5 Dual Palindromes双重回文数
- hdu ACM steps 1.2.5 hdu3188
- 杭电2734QuickSum
- vs2010 qt5.0.2 addin1.2.5 报错