Skip to content
ac-library-mojo Docs
min_
日本語
English
Initializing search
GitHub
Home
TIPs
APIs
Benchmark
Contribute
License
ac-library-mojo Docs
GitHub
Home
TIPs
APIs
APIs
cpp
cpp
algorithm
algorithm
next_permutation
prev_permutation
ext
ext
data_structure
data_structure
avltree
avltree
AVLTree
AVLTreeNode
binarytrie
binarytrie
BinaryTrie
BinaryTrieNode
dualsegtree
dualsegtree
DualSegTree
RAddQ
RUpdateQ
interval_heap
interval_heap
IntervalHeap
potentialized_unionfind
potentialized_unionfind
PotentializedUnionFind
UnionFindMul
UnionFindPlus
priority_queue
priority_queue
PriorityQueue
heap_max
heap_min
wordsizetree
wordsizetree
WordSizeTree
dp
dp
knapsack_problem
knapsack_problem
knapsack
knapsack_01
levenshtein_distance_problem
levenshtein_distance_problem
edit_distance
levenshtein_distance
longest_increasing_subsequence_problem
longest_increasing_subsequence_problem
longest_increasing_subsequence
math
math
affine
affine
Affine
py
py
bisect
bisect
bisect_left
bisect_right
builtin
builtin
pow_mod
heapq
heapq
heapify
heappop
heappush
heappushpop
heapreplace
itertools
itertools
permutations
math
math
isqrt
operator
operator
add
gt
inv
lt
max_
min_
mul
neg
truediv
sympy
sympy
isprime
convolution
convolution
convolution_int
convolution_mod
dsu
dsu
DSU
fenwicktree
fenwicktree
FenwickTree
io
io
IO
lazysegtree
lazysegtree
LazySegTree
RAddMaxQ
RAddMinQ
RAddSumQ
RUpdateMaxQ
RUpdateMinQ
RUpdateSumQ
math
math
crt
floor_sum
inv_mod
maxflow
maxflow
MFEdge
MFGraph
metadata
metadata
get_version
method_traits
method_traits
AddGroup
AddMonoid
Field
HasAdd
HasInitInt
HasInitStringRaising
HasMul
HasNeg
HasSub
HasTruediv
Invable
MulGroup
MulMonoid
Ring
SemiRing
mincostflow
mincostflow
MCFEdge
MCFGraph
modint
modint
StaticModint
scc
scc
SCCGraph
segtree
segtree
SegTree
RMaxQ
RMinQ
RMulQ
RSumQ
max_right
min_left
string
string
lcp_array
string_to_list
suffix_array
z_algorithm
twosat
twosat
TwoSat
Benchmark
Contribute
License
APIs
>
py
>
operator
>
min_
min_
min_[T: LessThanComparable & Copyable & Movable](x: T, y: T) -> T