杭电2734 Quicksum

原创 2015年11月17日 17:28:03

Quicksum

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3021    Accepted Submission(s): 2232


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 Input
ACM MID CENTRAL REGIONAL PROGRAMMING CONTEST ACN A C M ABC BBC #
 

Sample Output
46 650 4690 49 75 14 15
 

Source
 
简单题:
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
char s[11000];
int i,l;
int main()
{
	while(gets(s))
	{
		if(strcmp(s,"#\0")==0)
		break;
		l=strlen(s);
		for(i=0;i<l;i++)
		{
			if(s[i]==' ')
			printf("%%20");
			else if(s[i]=='!')
			printf("%%21");
			else if(s[i]=='$')
			printf("%%24");
			else if(s[i]=='%')
			printf("%%25");
			else if(s[i]=='(')
			printf("%%28");
			else if(s[i]==')')
			printf("%%29");
			else if(s[i]=='*')
			printf("%%2a");
			else printf("%c",s[i]);
		}
		printf("\n");
	}
}


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

POJ3094 UVALive3594 HDU2734 ZOJ2812 Quicksum【进制】

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

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

Problem Description A checksum is an algorithm that scans a packet of data and returns a single num...

hdu 2734(Quicksum)

计算一串字符的“Quicksum”的结果。计算规则为每一个字符的(字母表位置*在单词中的位置)之和,如果是空格则为零。(例:‘A C M’=75:‘A’在字母表中是第1个,在这个单词中也是第1个,所以...
  • xu_zh
  • xu_zh
  • 2015年07月28日 10:48
  • 212

杭电acm的一到题

  • 2013年11月20日 16:47
  • 305B
  • 下载

zoj_2812 Quicksum

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

杭电oj acm 2028

  • 2013年01月16日 16:50
  • 2KB
  • 下载

杭电多媒体作业

  • 2013年03月05日 10:30
  • 79KB
  • 下载

Quicksum

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

杭电人工智能导论-五子棋

  • 2012年06月27日 11:01
  • 308KB
  • 下载
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:杭电2734 Quicksum
举报原因:
原因补充:

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