H - Quicksum(1.5.3)
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d
& %I64u
cid=1006#status//H/0" class="ui-button ui-widget ui-state-default ui-corner-all ui-button-text-only" style="font-family:Verdana,Arial,sans-serif; font-size:1em; border:1px solid rgb(211,211,211); background-color:rgb(227,228,248); color:rgb(85,85,85); display:inline-block; position:relative; padding:0px; margin-right:0.1em; zoom:1; overflow:visible; text-decoration:none">Status
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 = 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
#include <iostream>
#include<cmath>
#include<iomanip>
using namespace std;
int main()
{
char a[10000];
int i;
int n,s;
while (cin.get(a,10000))
{ s=0;
if(a[0]=='#')
return 0;
n=strlen(a);
for(i=0;i<n;i++)
{
if(a[i]>='A'&&a[i]<='Z')
{s=s+(i+1)*int(a[i]-64);} } cout<<s<<endl;
cin.get();
}
return 0;
}
最新文章
- css position:absolute 如何居中对齐
- phpMyAdmin在Mac OS X上的配置和使用
- Env:Cscope安装与配置
- Windows Server 2012配置开机启动项
- [转载]函数getopt(),及其参数optind
- Xshell 的安装教程
- Hive入门学习--HIve简介
- Linux下部署开源版“禅道”项目管理系统
- linux五种I/O模型
- JSON CSRF新姿势
- ue4 编辑器记录
- maven(一) 一 修改仓库存放路径
- Calendar 日历类的时间操作
- Spring-MVC依赖
- Kafka一些常见资源汇总
- 爬虫之Scrapy详解
- union-find算法
- (网络流 匹配 KM) Going Home --poj -- 2195
- [ 转载 ] Java Jvm内存介绍
- django实战-留言板