maomao90's Library
A C++20 library for competitive programming.
|
▼Nmaomao90 | |
▼Ninternal | |
▼Nhashing | |
CHashObject | |
▼Nmath | |
Cbarrett | |
▼Nmodint | |
Cmodint_base | |
Cstatic_modint_base | |
▼Nmonoid | |
Climits | |
Climits< false, T > | |
Climits< is_min, pair< A, B > > | |
Climits< is_min, tuple< Head, Tail... > > | |
Climits< is_min, tuple<> > | |
Climits< MAX_FLAG, __int128 > | |
Climits< MIN_FLAG, __int128 > | |
Climits< true, T > | |
▼Npoly | |
▼Nntt | |
Cntt_info | |
▼Nsplaytree | |
CNode | |
CNode< T, L, true > | |
▼Ntype_traits | |
Cis_pair | |
Cis_pair< pair< T, U > > | |
Cis_valid_setting | |
Cis_valid_setting< complex< T >, PolySetting::fft_complex > | |
Cis_valid_setting< T, PolySetting::fft > | |
Cis_valid_setting< T, PolySetting::fft_sqrt > | |
Cis_valid_setting< T, PolySetting::ntt > | |
Cdynamic_modint | |
CHashingCustomHash | |
CHashMap | |
CLazySegTree | |
CMaxMonoid | |
CMinMonoid | |
CMultisetHash | |
CNoLazy | Lazy that does not apply any updates |
CPoly | |
CSegTree | |
CSplayTree | A balanced binary search tree |
Cstatic_modint | |
CSumMonoid | |
CValueMonoid | Only stores a value, and does not have a binary operation |