Re-exports§
pub use convolution::convolution;pub use convolution::convolution_i64;pub use dsu::Dsu;pub use fenwicktree::FenwickTree;pub use lazysegtree::LazySegtree;pub use lazysegtree::MapMonoid;pub use math::crt;pub use math::floor_sum;pub use math::inv_mod;pub use math::pow_mod;pub use maxflow::Edge;pub use maxflow::MfGraph;pub use mincostflow::MinCostFlowGraph;pub use modint::Barrett;pub use modint::ButterflyCache;pub use modint::DefaultId;pub use modint::DynamicModInt;pub use modint::Id;pub use modint::Mod1000000007;pub use modint::Mod998244353;pub use modint::ModInt;pub use modint::ModInt1000000007;pub use modint::ModInt998244353;pub use modint::Modulus;pub use modint::RemEuclidU32;pub use modint::StaticModInt;pub use scc::SccGraph;pub use segtree::Additive;pub use segtree::Max;pub use segtree::Min;pub use segtree::Monoid;pub use segtree::Multiplicative;pub use segtree::Segtree;pub use string::lcp_array;pub use string::lcp_array_arbitrary;pub use string::suffix_array;pub use string::suffix_array_arbitrary;pub use string::suffix_array_manual;pub use string::z_algorithm;pub use string::z_algorithm_arbitrary;pub use twosat::TwoSat;
Modules§
- convolution
- dsu
- A Disjoint set union (DSU) with union by size and path compression.
- fenwicktree
- lazysegtree
- math
- Number-theoretic algorithms.
- maxflow
- mincostflow
- modint
- Structs that treat the modular arithmetic.
- scc
- A
SccGraphis a directed graph that calculates strongly connected components (SCC) in $O(|V| + |E|)$. - segtree
- string
- twosat
- A 2-SAT Solver.