POJ3094-Quicksum解题报告
2012-07-17 20:23
323 查看
Quicksum
DescriptionA 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, andin 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, includingconsecutive 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 exampleQuicksum calculations for the packets "
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 10876 | Accepted: 7489 |
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 = 650InputThe 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.OutputFor 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
#include<iostream>using namespace std;int value[100];void setvalue(){int i = 1, num;value[' '] = 0;for(num = 'A'; num <= 'Z'; num ++){value[num] = i;i++;}}int main(){setvalue();char characters[10000];int i,j,sum = 0,length;while(1){gets(characters);if(!strcmp(characters,"#")){return 0;}length = strlen(characters);for(i = 0;i <= length; i++){sum += value[characters[i]]*(i+1);}cout << sum <<endl;sum = 0;}system("pause");return 0;}[/code]
相关文章推荐
- Quicksum解题报告
- URAL 1699 Turning Turtles 解题报告
- USACO Ski Course Design 解题报告
- 洛谷1601 A+B Problem(高精) 解题报告
- 【解题报告】Codeforces Round #364 (Div. 2)
- 洛谷1328 生活大爆炸版石头剪刀布 解题报告
- NOIP2010 机器翻译 解题报告(水题)
- vijos P1005 超长数字串 解题报告
- POJ 3645 解题报告
- 多校训练赛 Furude_Rika and wall 解题报告(dp)
- POJ 2743 字符串判等 解题报告
- 宁波比赛解题报告
- 杭电2048解题报告
- ZOJ 3714 Java Beans 解题报告
- [LintCode] 474 Lowest Common Ancestor II 解题报告
- NOIP 2006年解题报告
- LeetCode-Binary Tree Paths -解题报告
- 复赛模拟试题 物品选取(重庆一中高2018级信息学竞赛测验7) 解题报告
- [1057 津津的储蓄计划]解题报告
- 2016.8.7测试解题报告(compages,weight,software)