本资源是北大暑期ACM训练营的全部课件资源，对打ACM比赛或者对算法爱好的人有很大的帮助。

国际大学生程序设计竞赛指南-ACM程序设计-曾棕根

算法笔记上机训练实战指南(高清完整版)，是你提高算法思想，锻炼算法实践能力的不二之选！你值得拥有！！

ACM图灵奖：1966-2006(第三版）.计算机发展史的缩影pdf电子 学习计算机人必看

ACM图灵奖演讲集：前20年（1966-1985），感受大师的风采！ 图灵奖以伟大的英国数学家、逻辑学家图灵名字命名，是计算机科学届的最高奖项。

算法设计与分析-以ACM大学生程序设计竞赛

ACM大学生程序设计竞赛在线题库精选题解 算法分析与设计习题解答

ACM-ICPC世界总决赛2004试题解析

OJ离线版 ACM离线本地测评/判定系统/软件 仅此一个压缩包即可解压，解压密码12343

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