I have listed my articles that may be useful in competition pros by series. In addition to this, I have posted an article explaining the problem that I solved, so I hope you can refer to it. Also, if you have an article you would like us to write, please let us know in the comments.
Confirmation of basic matters of competition professionals ~ Cumulative sum and immoss method ~
Confirmation of basic items of competition pro ~ Method of permutation generation ~
Confirmation of basic items of competition professional ~ Binary search ~
Confirm basics of competition professionals ~ gcd and lcm ~
Confirmation of application items of competition professional ~ (extended) Dijkstra method ~
Confirmation of application items of competition professional ~ Inclusion principle ~ Creating </ font>
Confirmation of application items of competition professional ~ Bellman-Ford method ~ Under construction </ font>
Confirmation of application items of competition professional ~ Minimum spanning tree ~ Creating </ font>
Organizing the library of competitive professionals ~ Sieve of Eratosthenes ~
Organization of Competitive Professional Library ~ Union-Find Tree ~
Organizing the library of competitive professionals ~ Enumerating divisors ~
Organizing the library of competitive professionals ~ Factorization ~
Organizing the library of competitive professionals ~ BIT (Binary Indexed Tree) ~
Competitive professional library organization ~ modint ~
Competitive Professional Template (C ++)
I tried to summarize the functions required to compete in Python ~ itertools ~
Mathematical explanation of binary search and ternary search and implementation method without bugs
Recommended Posts