2018_1_20_quicksum,poj3094,水题
2018-01-20 14:34
363 查看
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
Sample Output
Source
Mid-Central USA 2006
#include<iostream>
#include<string>
using namespace std;
inline int value(char c){
if(c==' ')return 0;
return c-'A'+1;
}
int main(){
string s;
while(getline(cin,s,'\n')){
if(s=="#")return 0;
long long sum=0;
for(int i=0;i<s.size();i++)
sum+=value(s[i])*(i+1);
cout<<sum<<endl;
}
}
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 17487 | Accepted: 12098 |
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
Source
Mid-Central USA 2006
#include<iostream>
#include<string>
using namespace std;
inline int value(char c){
if(c==' ')return 0;
return c-'A'+1;
}
int main(){
string s;
while(getline(cin,s,'\n')){
if(s=="#")return 0;
long long sum=0;
for(int i=0;i<s.size();i++)
sum+=value(s[i])*(i+1);
cout<<sum<<endl;
}
}
相关文章推荐
- Quicksum(poj3094,水题)
- Heap_堆_2018_2_20
- POJ3094,Quicksum,自信题
- 1084. Broken Keyboard (20)-水题
- PAT甲题题解-1050. String Subtraction (20)-水题
- PAT L1-044. 稳赢2018_2_20
- PAT甲题题解-1104. Sum of Number Segments (20)-(水题)
- 2018_1_20_ujn_oj
- POJ 3094 Quicksum 水题
- PAT甲题题解-1120. Friend Numbers (20)-水题
- 1005. Spell It Right (20)水题
- LeetCode-20-Valid-Parentheses 栈 水题 Python 列表删除操作
- POJ3094-- Quicksum
- ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined) Codeforces932 A. Palindromic Supersequence(水题) B.Recursive Queries(前缀和) C.Permutation Cycle(数学)
- 2018_1_20_Number Sequence_古怪
- 到底买不买(20)----暴力水题
- 2018_1_21_Speed Limit_水题
- zoj 2812 Quicksum 水题
- POJ3094:Quicksum
- 2018_3_20 异常