Transcription of Competitive Programmer’s Handbook
{{id}} {{{paragraph}}}
Example: quiz answers
Competitive Programmer’s Handbook
Competitive Programmer s HandbookAntti LaaksonenDraft August 19, 2019iiContentsPrefaceixI 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.
Chapter 1 Introduction Competitive programming combines two topics: (1) the design of algorithms and (2) the implementation of algorithms. The design of algorithms consists of problem solving and mathematical thinking.
Loading..
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: