Algorithms for Competitive Programming 관련

• Table of Contents

---

Algorithms for Competitive Programming

---

Main Page > Algorithms for Competitive Programming

The goal of this project is to translate the wonderful resource which provides descriptions of many algorithms and data structures especially popular in field of competitive programming. Moreover we want to improve the collected knowledge by extending the articles and adding new articles to the collection.

---

Table of Contents

• 1. Algebra
  • 01A. Fundamentals
  • 01B. Prime Numbers
  • 01C. Number-theoretic functions
  • 01D. Modular arithmetic
  • 01E. Number systems
  • 01F. Misc
• 2. Data Structures
  • 02A. Fundamentals
  • 02B. Trees
  • 02C. Advanced
• 3. Dynamic Programming
  • 03A. Introduction
  • 03B. DP Optimizations
  • 03C. Tasks
• 4. String Processing
  • 04A. Fundamentals
  • 04B. Advanced
  • 04C. Tasks
• 5. Linear Algebra
  • 05A. Metrices
• 6. Combinatorics
  • 06A. Fundamentals
  • 06B. Techniques
  • 06C. Tasks
• 7. Numerical Methods
  • 07A. Search
  • 07B. Integration
• 8. Geometry
  • 08A. Elementary operations
  • 08B. Polygons
  • 08C. Convex hull
  • 08D. Sweep-line
  • 08E. Planar graphs
  • 08F. Misc
• 9. Graphs
  • 09A. Graph traversal
  • 09B. Connected components, bridges, articulations points
  • 09C. Single-source shortest paths
  • 09D. All-pairs shortest paths
  • 09E. Spanning trees
  • 09F. Cycles
  • 09G. Lowest common ancestor
  • 09H. Flows and related problems
  • 09I. Matchings and related problems
  • 09J. Misc
• 10. Misc
  • 10A. Sequences
  • 10B. Game Theory
  • 10C. Schedules
  • 10D. Misc

---