competitive-programming-rs

repository·master·Indexed 43 days ago

https://github.com/kenkoooo/competitive-programming-rs

A collection of optimized, well-tested Rust implementations of common algorithms and data structures for competitive programming. Version 41.0.0 includes modules for graph theory, data structures (such as Segment Trees and Fenwick Trees), mathematics (FFT, Chinese Remainder Theorem), geometry, and string processing.

Tokens
717
Snippets
2
Records
9
Agent score
6%

What's inside competitive-programming-rs

  1. Overview of competitive-programming-rs

    master
    The competitive-programming-rs repository provides a collection of well-tested algorithms implemented in Rust, specifically designed for rapid use during programming competitions. The library covers a wide range of algorithmic categories including Data Structures, Geometry, Graph theory, Mathematics, and String processing.
  2. Use the Competitive Programming Library in Rust

    master

    The competitive-programming-rs library provides a collection of optimized snippets and algorithms designed for use in programming contests. The library is organized into several modules based on algorithmic categories:

    • graph: Graph theory algorithms.
    • data_structure: Efficient data structures for competitive programming.
    • math: Mathematical algorithms and number theory.
    • geometry: Computational geometry algorithms.
    • string: String processing and pattern matching algorithms.
    • utils: Utilities for handling standard input/output (stdin/stdout) and testing.
    // Example of how you might import modules from this library
    use competitive_programming_rs::graph;
    use competitive_programming_rs::data_structure;
    use competitive_programming_rs::math;
    use competitive_programming_rs::geometry;
    use competitive_programming_rs::string;
    use competitive_programming_rs::utils;