POJ 3094 Quicksum 水
2015-08-05 19:57
477 查看
Quicksum
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 "
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
Quicksum
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 15028 | Accepted: 10494 |
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
ACM MID CENTRAL REGIONAL PROGRAMMING CONTEST ACN A C M ABC BBC #Sample Output46 650 4690 49 75 14 15
AC代码:
#include <iostream> #include <cstdio> #include <cstring> #include <cmath> #include <cctype> using namespace std; void my(string s){ int len=s.length(); int sum=0; for(int i=0;i<s.length();++i){ if(isupper(s[i]))sum+=(s[i]-64)*(i+1); } cout<<sum<<'\12'; } int main(){ string s; while(getline(cin,s)&&s!="#"){ my(s); } return 0; }
相关文章推荐
- UVa 10099 The Tourist Guide (最大生成树+最小边的最大化+Kruskal)
- UIPageControl
- 【JSP基础】Jsp中request与session的用法
- UINavigationController 简要笔记
- UIScrollView
- android android:duplicateParentState="true" "false"
- UIScrollView, UIPageControl,UITableView
- [IOS]今天开始学UI---UIImageView
- Handler MessageQueue Looper
- HDU 4372 Count the Buildings(组合数+斯特林数)
- HDOJ--1242--Rescue
- 【HDU1503】【Advanced Fruits】
- iOS开发之----根据文本内容和字体大小计算UILabel的size
- HDU 1509 Windows Message Queue(优先队列)
- UIPageControl(滑动图片时底下的圆点)
- [IOS]今天开始学UI---UIDatePicker
- ServerGuide 引导安装指南教程(图文)
- iOS UITableviewCell的重用机制
- UIScrollView(滑动切换图片,图片的循环切换(自动))
- Android酷炫实用的开源框架(UI框架)