Poj 3094 Quicksum
来源:互联网 发布:怎么在淘宝上开店铺步骤 编辑:程序博客网 时间:2024/05/19 20:56
1.Link:
http://poj.org/problem?id=3094
2.Content:
QuicksumTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13925 Accepted: 9719Description
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 = 650Input
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
46650469049751415Source
Mid-Central USA 2006
3.Method:
簡單題,考了循環的基本用法
4.Code:
1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 5 using namespace std; 6 7 int main() 8 { 9 //freopen("D://input.txt","r",stdin);10 11 int i;12 13 char str[256];14 15 cin.getline(str,256);16 17 while(str[0] != '#')18 {19 int sum = 0;20 for(i = 0; i < strlen(str); ++i)21 {22 if(str[i] != ' ')23 {24 sum += (i + 1) * (str[i] - 'A' + 1); 25 } 26 }27 28 cout << sum << endl; 29 30 cin.getline(str,256);31 }32 33 return 0;34 }
5:Reference:
http://blog.csdn.net/steven30832/article/details/6003006
http://baike.baidu.com/view/2383876.htm
- POJ 3094 Quicksum 水题
- poj 3094 Quicksum
- POJ 3094 Quicksum
- POJ 3094 Quicksum
- poj 3094 Quicksum
- POJ 3094 Quicksum
- POJ 3094 quicksum lightblueme
- 【POJ-3094】Quicksum
- POJ 3094 Quicksum【水水】
- poj 3094 Quicksum
- POJ 3094 Quicksum
- POJ 3094 - Quicksum
- POJ 3094 Quicksum
- Poj 3094 Quicksum
- POJ 3094 Quicksum
- POJ 3094 Quicksum 水
- poj 3094 Quicksum
- POJ 3094 Quicksum G++
- 模板:筛素数法
- Poj 2255 Tree Recovery
- Poj 2262 / OpenJudge 2262 Goldbach's Conjecture
- Poj 2299 Ultra-QuickSort
- Poj 3006 Dirichlet's Theorem on Arithmetic Progressions
- Poj 3094 Quicksum
- 模板:cin.getline用法
- Poj 2388 Who's in the Middle
- Poj 2503 / OpenJudge 2503 Babelfish
- Poj 2965 The Pilots Brothers' refrigerator
- Poj 1328 / OpenJudge 1328 Radar Installation
- 查看linux系统版本命令
- Poj 2109 / OpenJudge 2109 Power of Cryptography
- Poj 2586 / OpenJudge 2586 Y2K Accounting Bug