ACM--steps--dyx--1.2.6--Quicksum
2015-03-22 18:01
411 查看
Quicksum |
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) |
Total Submission(s): 2637 Accepted Submission(s): 1655 |
Problem 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 = 46MID 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 InputACM MID CENTRAL REGIONAL PROGRAMMING CONTEST ACN A C M ABC BBC # |
Sample Output46 650 4690 49 75 14 15 |
Source Mid-Central USA 2006 |
Recommend teddy #include<iostream> #include<cstdio> #include<cstring> using namespace std; int main() { int dyx[27]; char wyx[1000]; for(int i=0;i<27;i++) { dyx[i]=i+1; } while(gets(wyx)) { int ans=0; if(!strcmp(wyx,"#")) break; int len=strlen(wyx); for(int i=0;i<len;i++) { if(wyx[i]>='A'&&wyx[i]<='Z') ans=ans+(i+1)*dyx[wyx[i]-'A']; } cout<<ans<<endl; } return 0; } |
相关文章推荐
- ACM--steps--dyx--1.2.1
- ACM--steps----dyx--1.2.8--AC Me
- ACM--steps--dyx--2.1.1--最小公倍数
- ACM--dyx--steps--3.1.8--Queuing
- ACM--steps--dyx--2.3.7--下沙的沙子有几粒?
- ACM--steps--dyx--2.3.2--Exponentiation
- ACM--steps--dyx--5.1.4--find the most comfortable road
- ACM--steps--dyx--1.2.2--
- ACM--steps--dyx--5.1.5--Code Lock
- ACM--steps-dyx--1.2.3--find your present (2)(异或)
- ACM--steps--dyx--1.3.2--今年暑假不AC
- ACM--steps--dyx--2.3.8--小兔的棋盘
- ACM--steps--dyx--1.2.4--Buildings
- ACM--steps--dyx--4.2.5--Open the lock(多向广搜)
- ACM--steps--dyx--1.2.5--The Seven Percent Solution
- ACM--steps--dyx--1.3.3--Tian Ji -- The Horse Racing
- ACM--steps--dyx--5.1.2--小希的迷宫
- ACM-steps--dyx--1.3.4--百步穿杨
- hdu ACM steps 1.2.6 hdu3361
- ACM--steps--dyx--1.3.5--开门人和关门人