Transcription of Competitive Programmer’s Handbook
{{id}} {{{paragraph}}}
Competitive Programmer s HandbookAntti LaaksonenDraft July 3, 2018iiContentsPrefaceixI Basic techniques11 programming languages .. Input and output .. Working with numbers .. Shortening code .. Mathematics .. Contests and resources ..152 Time Calculation rules .. Complexity classes .. Estimating efficiency .. Maximum subarray sum ..213 Sorting theory .. Sorting in C++ .. Binary search ..314 Data Dynamic arrays .. Set structures .. Map structures .. Iterators and ranges .. Other structures .. Comparison to sorting ..445 Complete Generating subsets .. Generating permutations .. Backtracking .. Pruning the search .. Meet in the middle ..54iii6 Greedy Coin problem .. Scheduling .. Tasks and deadlines .. Minimizing sums .. Data compression ..627 Dynamic Coin problem .. Longest increasing subsequence.
programming. It is assumed that you already know the basics of programming, but no previous background in competitive programming is needed. The book is especially intended for students who want to learn algorithms and possibly participate in the International Olympiad in Informatics (IOI) or in the International Collegiate Programming Contest ...
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}