Guide to Competitive ProgrammingLearning and Improving Algorithms Through Contests\nAuthor(s): Antti Laaksonen\nFormat: Paperback\nPublisher: Springer International Publishing AG, Switzerland\nImprint: Springer International Publishing AG\nISBN-13: 9783031617935, 978-3031617935\nSynopsis\nThis textbook features new material on advanced topics, such as calculating Fourier transforms, finding minimum cost flows in graphs, and using automata in string problems. Critically, the text accessibly describes and shows how competitive programming is a proven method of implementing and testing algorithms, as well as developing computational thinking and improving both programming and debugging skills.\n\nTopics and features:\n\nIntroduces dynamic programming and other fundamental algorithm design techniques, and investigates a wide selection of graph algorithms\nCompatible with the IOI Syllabus, yet also covering more advanced topics, such as maximum flows, Nim theory, and suffix structures\nPr.