Programming Challenges: The Programming Contest Training Manual
.¿An Ideal Resource for Improving Programming Knowledge¿. The challenges of problems from international programming competitions are an effective way to improve algorithmic and coding skills and understanding. This book uses international programming competition-type problems to motivate the study of algorithms, programming, and other topics in computer science. It includes more than 100 programming challenges, as well as the theory and key concepts necessary for approaching them. Problems are organized by topic, and supplemented by complete tutorial material. Readers gain a concrete understanding of both algorithmic techniques and advanced coding topics. Unique Features: * Offers a wealth of rich programming problems suitable for self-study -- all with on-line judging at www.programming-challenges.com * Presents practice training for all major programming contests --ACM International Collegiate Programming Contest (ACM ICPC), International Olympiad in Informatics (IOI), and Topcoder Challenge * Serves as a convenient, web-based means of adding a programming component to any algorithms or software engineering course * Contains complete working code for fundamental data structures and graph, string, numerical and geometric algorithms * Provides a brief-yet-thorough treatment of key elements in number theory, geometry, dynamic programming, and graph algorithms * Supports all popular programming languages (C, C++, Pascal, Java) Steven S. Skiena is a member of the faculty of computer science at SUNY Stony Brook and is author of many widely used books, including The Algorithm Design Manual. He received the 2001 IEEE Computer Society Undergraduate Teaching Award. Miguel Revilla is a member of the faculty of computer science at the University of Valladolid, Spain. He is official website archivist of the ACM ICPC and creator/maintainer of the primary robot-judge, contest-hosting website.
レビュー - レビューを書く
Arithmetic and Algebra
他の版 - すべて表示
adjacency lists algorithm angle array average Level b—>signbit backtracking bignum blank line cards cells char characters compute conﬁguration consecutive coordinates counter cycle data structures deﬁned deletion denoted digits directed graphs distance dynamic programming edge eﬁicient elements Eulerian cycle example ﬁeld ﬁgure ﬁnal ﬁnd ﬁnding ﬁoating ﬁoor ﬁow ﬁrst line ﬁve function given Gordon Cormack graph grid hexagonal implementation input ﬁle Input Sample Output Input The input intersection length line containing line of input longest nap Lugoj Manzoor matrix minimum spanning tree modular arithmetic multiple operations pair PC/UVa IDs polygon Popularity possible prime print a line printf priority queue problem Programming Contest queue recursive represent Sample Input Sample segments sequence shortest path single integer solution solve sorting space spanning tree speciﬁcation square stack string subset Success rate TopCoder Topological sorting triangle vertex vertices weight write a program