poj 3094 Quicksum

原创 2016年06月01日 10:42:29

水题:

Quicksum
Time Limit: 1000MS   Memory Limit: 65536K
Total Submissions: 11249   Accepted: 7741
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<stdio.h>
#include<math.h>
#include<string.h>
int main(){
	char a[300];
	int i,j,k,len,sum;
	while(gets(a)){
		if(!strcmp(a,"#"))break;
		len=strlen(a);
		sum=0;
		for(i=0;i<len;i++){
			if(a[i]==' ') continue;
			sum+=(a[i]-'A'+1)*(i+1);
		}
		printf("%d\n",sum);
	}
	return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

POJ3094-Quicksum

  • 2011年07月29日 01:28
  • 6KB
  • 下载

POJ3094 UVALive3594 HDU2734 ZOJ2812 Quicksum【进制】

Quicksum Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 16976   Accepted: 11781 ...

POJ 3094代码

  • 2014年03月22日 23:03
  • 404B
  • 下载

zoj_2812 Quicksum

Requirement: A checksum is an algorithm that scans a packet of data and returns a single number. Th...

Quicksum

/* *程序的版权和版本声明部分: *Copyright(c)2014,烟台大学计算机学院学生 *All rights reserved. *文件名称: *作者:田成琳 *完成日期:201...

sicily_1388_Quicksum

1388. Quicksum Constraints Time Limit: 1 secs, Memory Limit: 32 MB Description A checksum is ...

问题八十三:Quicksum

Quicksum 数据只由26个大写字母和空格组成,并且一定由大写字母开始和结束. 除此之外,它可以任意组合,包括出现连续空格。 Quicksum 是每个字母位置和字母值乘积的总和。空格的值为0,...

hdu3094 A tree game----树的删边游戏

A tree game Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) To...

3094Escape from Enemy Territory——zoj

思路  因为题中说了曼哈顿距离   所以在遍历中  每走一步就是一个距离   就缩小了难度(业界良心。。) 又说要找最小最大距离。。 对于每一个点的预处理最小距离就是一定了 然后再...

[水题][第一阶段-英文题试水][HDOJ-2734]Quicksum

Problem Description A checksum is an algorithm that scans a packet of data and returns a single num...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:poj 3094 Quicksum
举报原因:
原因补充:

(最多只允许输入30个字)