USP Programming Marathon Preparation Repository

This repository is a treasure trove of algorithms crafted during rigorous preparation for the USP Programming Marathon, which serves as the local version of the International Collegiate Programming Contest (ICPC). The algorithms gathered here are primarily sourced from introductory levels on Codeforces, providing an invaluable resource for aspiring competitive programmers.

Repository Overview

🚀 Despite being a bit old and no longer actively maintained, this repository holds a myriad of algorithms that were instrumental in honing problem-solving skills and mastering the art of efficient coding. Please note that due to the lack of active maintenance, the organization and structure of this repository may not be optimal.

Contents

The repository encompasses a diverse range of algorithms covering various topics, including but not limited to:

• Dynamic Programming
• Graph Theory
• Number Theory
• Greedy Algorithms
• Data Structures

Feel free to explore the repository's content and leverage the algorithms to enhance your understanding of these crucial concepts.

Disclaimer

⚠️ This repository is being provided as-is, without ongoing maintenance or updates. It was primarily utilized as a personal record-keeping tool for solved problems during preparation for programming competitions. As a result, the codebase might not meet the standard of well-structured repositories.