POJ3094-Quicksum解题报告

最新推荐文章于 2013-04-25 13:02:43 发布

princeyuaner

最新推荐文章于 2013-04-25 13:02:43 发布

阅读量776

点赞数

分类专栏： poj上的水题文章标签： character algorithm output each system input

本文链接：https://blog.youkuaiyun.com/princeyuaner/article/details/7756792

版权

poj上的水题专栏收录该内容

9 篇文章

订阅专栏

本文深入探讨了Quicksum算法的原理与应用，通过实例展示了如何计算Quicksum值，并提供了完整的代码实现。Quicksum是一种用于数据校验的算法，特别适用于检测数据传输错误或验证文档内容的一致性。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Quicksum

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 10876		Accepted: 7489

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

#include<iostream>
using namespace std;

int value[100];

void setvalue(){
	int i = 1, num;
	value[' '] = 0;
	for(num = 'A'; num <= 'Z'; num ++){
		value[num] = i;
		i++; 
		}
	}

int main(){
	setvalue();
	char characters[10000];
	int i,j,sum = 0,length;
	while(1){
		gets(characters);
		if(!strcmp(characters,"#")){
			return 0;
			}
			length = strlen(characters);
			
			for(i = 0;i <= length; i++){
				sum += value[characters[i]]*(i+1);
				}
				cout << sum <<endl;
				sum = 0;
		}
	
	system("pause");
	return 0;
	}