How lucasgabriel-cp/competitive_prog works
Main Components
• Codes Library: This is the core component and includes subdirectories for various algorithm categories such as Data Structures (e.g., Binary Search Trees, Segment Trees), Geometry, Graph Algorithms, Mathematics algorithms, Paradigms, and String processing. Each subdirectory encapsulates implementations that are reusable in competitive programming challenges.
• Solutions: This part of the repository is organized by problem source – indicated by directories like Beecrowd (URI), SPOJ, UVA, misc, etc. It contains individual solutions to competitive programming problems, leveraging the algorithms and data structures implemented in the Codes library.
• Ancillary Files: Other files such as the makefile and template.cpp serve as build scripts or starting templates for new solution files.
Architectural Patterns and Design Principles
• Modularity: Each folder within Codes represents a self-contained module (e.g., Graph, Data Structures) that is designed for reusability.
• Separation of Concerns: The project is clearly divided between general-purpose algorithms and problem-solving implementations. This separation improves maintainability and allows isolated testing and extension.