算法设计与分析-以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

我去年暑假花了5天，把杭电ACM网站上2000到2099这100道题全AC了，又花了10来天精心写解题报告。里面包括题目、解题思路、编程技巧以及参考源码。所有代码都是使用C/C++写的。最近整理资料时无意间发现，打包成chm文件和大家分享。

本资源为上海交通大学ACM班机器学习课程(张伟南授)的全部PPT文件。

涉及各种算法的讲解，比如（二分匹配，背包专题，筛选法，简单数学题，贪心算法，递推求解，动态规划，并查集，母函数，搜索，组合博弈等入门算法）

本资源详细记录了天津大学acm队选拔赛的所有题目，并给出源代码详细和文档详细解析，相信对你很有帮助如果你想提高编程能力

一些经典算法如贪心，分治，动态规划等的题集，有些有答案，有些只有题目。因为是从网上DOWN的，所以不收资源分了，呵呵。 值得下载。