zju 2812 Quicksum---------hdu 2734
2014-08-01 19:17
465 查看
QuicksumTime Limit: 2 Seconds Memory Limit: 65536 KB
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":
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.
View Code
#include<iostream> #include<cstring> #include<string> using namespace std; int main() { string s; int sum,i; while(getline(cin,s)) { if(s[0]=='#') break; sum=0; for(i=0;i<s.size();i++) if(s[i]==' ') sum+=0; else sum+=(i+1)*(s[i]-'A'+1); cout<<sum<<endl; } return 0; }
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.
#include<iostream> #include<cstring> #include<string> using namespace std; int main() { string s; int sum,i; while(getline(cin,s)) { if(s[0]=='#') break; sum=0; for(i=0;i<s.size();i++) if(s[i]==' ') sum+=0; else sum+=(i+1)*(s[i]-'A'+1); cout<<sum<<endl; } return 0; }
View Code
#include<iostream> #include<cstring> #include<string> using namespace std; int main() { string s; int sum,i; while(getline(cin,s)) { if(s[0]=='#') break; sum=0; for(i=0;i<s.size();i++) if(s[i]==' ') sum+=0; else sum+=(i+1)*(s[i]-'A'+1); cout<<sum<<endl; } return 0; }
相关文章推荐
- ZOJ 2812 Quicksum
- zoj 2812 Quicksum
- POJ 3094/ ZOJ 2812: Quicksum 【.get()】
- ZOJ Problem Set - 2812 Quicksum
- zoj 2812 Quicksum 水题
- ZOJ-2812-Quicksum-getline读入一行文本
- ZOJ 2812 Quicksum (简单的求和~水)
- ZOJ Problem Set - 2812 Quicksum
- ZOJ 2812 Quicksum
- ZOJ 2812 Quicksum
- zoj_2812 Quicksum
- ZOJ 2812 Quicksum
- LC-Display(ZJU_1146)
- ZJU 1115 解题报告
- zju1081 判断点是否在简单多边型内(包括凹的情况)
- ZJU2027 Travelling Fee - 最短路径
- ZJU2039 The Dog Task - 二部图最大匹配
- Zju 2740 Message System解题分析
- ZJU_3048 Continuous Same Game
- ZJU 1107 FatMouse and Cheese