Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/atcoder/ac-library
/ types & classes
Types & classes
41 in github.com/atcoder/ac-library
⨍
Functions
988
◇
Types & classes
41
↓ 1 callers
Class
ExampleReader
tools/generate_document.py:19
↓ 1 callers
Class
Expander
expander.py:15
↓ 1 callers
Class
barrett
Fast modular multiplication by barrett reduction Reference: https://en.wikipedia.org/wiki/Barrett_reduction NOTE: reconsider after Ice Lake
atcoder/internal_math.hpp:25
↓ 1 callers
Class
dsu
test/expander/comment_out.cpp:7
↓ 1 callers
Class
scc_graph
atcoder/scc.hpp:12
↓ 1 callers
Class
two_sat
Reference: B. Aspvall, M. Plass, and R. Tarjan, A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas
atcoder/twosat.hpp:15
Class
A
test/unittest/type_traits_test.cpp:12
Class
F
test/example/lazyseg_practice1.cpp:15
Class
Q
atcoder/mincostflow.hpp:115
Class
S
test/example/lazyseg_practice1.cpp:10
Class
S
test/example/lazyseg_practice2.cpp:10
Class
S
test/unittest/lazysegtree_stress_test.cpp:31
Class
T
test/unittest/lazysegtree_stress_test.cpp:35
Class
Test
test/test_expander.py:15
Class
_edge
atcoder/maxflow.hpp:141
Class
_edge
atcoder/mincostflow.hpp:97
Class
const_starry
test/unittest/lazysegtree_test.cpp:93
Class
csr
atcoder/internal_csr.hpp:11
Class
dsu
Implement (union by size) + (path compression) Reference: Zvi Galil and Giuseppe F. Italiano, Data structures and algorithms for disjoint set union pr
atcoder/dsu.hpp:14
Class
dynamic_modint
atcoder/modint.hpp:141
Class
edge
atcoder/internal_scc.hpp:79
Class
edge
atcoder/maxflow.hpp:33
Class
edge
atcoder/mincostflow.hpp:30
Class
fenwick_tree
atcoder/fenwicktree.hpp:12
Class
fft_info
atcoder/convolution.hpp:20
Class
is_dynamic_modint
atcoder/modint.hpp:264
Class
is_dynamic_modint<dynamic_modint<id>>
atcoder/modint.hpp:266
Class
lazy_segtree
atcoder/lazysegtree.hpp:22
Class
lazy_segtree
atcoder/lazysegtree.hpp:45
Class
mcf_graph
atcoder/mincostflow.hpp:15
Class
mf_graph
atcoder/maxflow.hpp:14
Class
modint_base
atcoder/modint.hpp:19
Class
scc_graph
Reference: R. Tarjan, Depth-First Search and Linear Graph Algorithms
atcoder/internal_scc.hpp:16
Class
segtree
atcoder/segtree.hpp:15
Class
segtree
atcoder/segtree.hpp:23
Class
segtree_naive
test/unittest/segtree_test.cpp:10
Class
simple_queue
atcoder/internal_queue.hpp:10
Class
starry
test/unittest/lazysegtree_test.cpp:10
Class
static_modint
atcoder/modint.hpp:28
Class
static_modint_base
atcoder/modint.hpp:20
Class
time_manager
time manager
test/unittest/lazysegtree_stress_test.cpp:14