competitive-programming-rs
| Crates.io | competitive-programming-rs |
| lib.rs | competitive-programming-rs |
| version | 41.0.0 |
| source | src |
| created_at | 2018-03-16 02:49:07.323044 |
| updated_at | 2022-12-04 23:44:47.410919 |
| description | Competitive Programming Library in Rust |
| homepage | https://docs.rs/competitive-programming-rs |
| repository | https://github.com/kenkoooo/competitive-programming-rs |
| max_upload_size | |
| id | 55890 |
| size | 162,541 |
kenkoooo (kenkoooo)
documentation
https://docs.rs/competitive-programming-rs
README
Competitive Programming Snippets in Rust
This is a repository of a set of algorithms implemented in Rust.
- Designed to solve problems quickly in programming competitions.
- Well-tested.
Data Structures
- BitSet
- Fenwick Tree
- Fibonacci Heap
- Lazy Segment Tree
- Persistent Array
- Segment Tree
- Sparse Table
- Suffix Array
- Treap
- Union-Find tree
Geometry
Graph
- Bridge Detection
- Lowest Common Ancestors
- Maximum Flow
- Minimum Cost Flow (Primal-Dual)
- Minimum Cost Flow (cost-scaling)
- Shortest Path (Bellman-Ford)
- Strongly Connected Components
- ReRooting
- Topological Sort
Mathematics
- Chinese Remainder Theorem
- Combination
- Cumulative Sum
- Fast Fourier Transform
- Floor Sum
- Lagrange Interpolation
- Max Rectangle
- Mod Integer
- Next Permutation