POJ3094,Quicksum,自信题
2012-10-16 18:33
197 查看
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 "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 Output
46
650
4690
49
75
14
15
分析:
水题,快要告一段落了。
code:
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
ACM
MID CENTRAL
REGIONAL PROGRAMMING CONTEST
ACN
A C M
ABC
BBC
#
Sample Output
46
650
4690
49
75
14
15
分析:
水题,快要告一段落了。
code:
#include<iostream> #include<cstdio> #include<cmath> #include<cstring> #include<string> using namespace std; int quicksum(char *s) { int i=0,sum=0; for(i=0;s[i]!='\0';i++) { if(s[i]!=' ') sum+=(s[i]-'A'+1)*(i+1); } return sum; } int main() { char s[260]; while(gets(s),s[0]!='#') printf("%d\n",quicksum(s)); return 0; }
相关文章推荐
- POJ3094-- Quicksum
- POJ3094-Quicksum解题报告
- 2018_1_20_quicksum,poj3094,水题
- POJ3094:Quicksum
- POJ3094_Quicksum
- POJ3094-Quicksum
- POJ3094-Quicksum
- POJ3094-Quicksum
- Quicksum(poj3094,水题)
- 自信的公式
- 李开复给中国学生的第三封信:成功、自信、快乐
- 给中国学生的第三封信:成功、自信、快乐(上)
- 毕业设计(二十一)-"自由支配百分之二十工作时间""Don't be evil""要自信"
- 李开复给中国学生的第三封信:成功、自信、快乐
- 自信--死神之手
- 自信、快乐的生活工作
- 成于自信,毁于自卑
- 自信,死而复生者的纹身
- 自信 VS 自疑
- 嵌入式工程师修炼:自信坚强 积极勤快