SDUT 1103 Quicksum
来源:互联网 发布:linux java环境搭建 编辑:程序博客网 时间:2024/06/14 20:37
题目描述
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
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
输入
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.
输出
For each packet, output its Quicksum on a separate line in the output.
示例输入
ACMMID CENTRALREGIONAL PROGRAMMING CONTESTACNA C MABCBBC#
示例输出
46650469049751415
- #include <stdio.h>
- #include <string.h>
- int main()
- {
- char s[300];
- int a[300];
- int i,sum;
- while(gets(s),s[0]!='#')
- {
- sum=0;
- for(i=0;i<strlen(s);i++)
- {
- if(s[i]=='A') a[i]=1;
- if(s[i]=='B') a[i]=2;
- if(s[i]=='C') a[i]=3;
- if(s[i]=='D') a[i]=4;
- if(s[i]=='E') a[i]=5;
- if(s[i]=='F') a[i]=6;
- if(s[i]=='G') a[i]=7;
- if(s[i]=='H') a[i]=8;
- if(s[i]=='I') a[i]=9;
- if(s[i]=='J') a[i]=10;
- if(s[i]=='K') a[i]=11;
- if(s[i]=='L') a[i]=12;
- if(s[i]=='M') a[i]=13;
- if(s[i]=='N') a[i]=14;
- if(s[i]=='O') a[i]=15;
- if(s[i]=='P') a[i]=16;
- if(s[i]=='Q') a[i]=17;
- if(s[i]=='R') a[i]=18;
- if(s[i]=='S') a[i]=19;
- if(s[i]=='T') a[i]=20;
- if(s[i]=='U') a[i]=21;
- if(s[i]=='V') a[i]=22;
- if(s[i]=='W') a[i]=23;
- if(s[i]=='X') a[i]=24;
- if(s[i]=='Y') a[i]=25;
- if(s[i]=='Z') a[i]=26;
- else if(s[i]==' ')
- a[i]=0;
- }
- for(i=0;i<strlen(s);i++)
- {
- sum=sum+a[i]*(i+1);
- }
- printf("%d\n",sum);
- }
- return 0;
- }
总感觉写麻烦了。。。但是又想不出来好的方法
0 0
- SDUT 1103 Quicksum
- 1103Quicksum
- Quicksum
- Quicksum
- QuickSum
- Quicksum
- Quicksum
- Quicksum
- Quicksum
- Quicksum
- Quicksum
- Quicksum
- Quicksum
- Quicksum
- Quicksum
- Quicksum
- Quicksum
- Quicksum
- 解决ERROR:Offending class: javax/servlet/Servlet.class及TLD skipped. URI: http://XX.com/jstl/* is ready
- SDUT 1098 Lowest Bit
- hdu 3473 Minimum Sum 再来一波划分树,对划分树累觉不爱。
- C#下的矩阵算法类
- jQuery弹性模态窗口导航菜单
- SDUT 1103 Quicksum
- 2.7学习内容 listview中item焦点获取顺序设置
- 比较两个UIImage是否相等
- (二十四)监听键盘的通知和键盘弹出隐藏的View移动
- android 透明布局点击穿透的处理
- Git使用手册:为Git仓库创建Submodule
- SDUT 1104 Image Transformation
- 为什么unix/linux/ubuntu比windows高级(国外专家解答)
- [LeetCode] Find Peak Element