-
Notifications
You must be signed in to change notification settings - Fork 1
/
contents.txt
64 lines (58 loc) · 1.59 KB
/
contents.txt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
[Number theory]
CountPrimes.cc Count primes up to N
ExtendedEuclide.cc Extended Euclide
SystemLinearEquations.cc System of linear equations
PollardRho.cc Pollard Rho
Cubic.cc Cubic
PythagoreTriple.cc PythagoreTriple
TonelliShanks.cc Tonelli-Shanks
[String]
SuffixArray.cc Suffix Array
AhoCorasick.cc Aho Corasick
Zalgo.cc Z algorithm
Manacher.cc Manacher
SuffixAutomaton.cc Suffix Automaton
ALCS.cc ALCS
Eertree.cc Palindromic Tree
LyndonFactorization.cc Lyndon Factorization
[Geometry]
Geometry.cc Geometry
[Numerical algorithms]
Gauss.cc Gauus Elimination
LPSolver.cc Simplex Algorithm
NTT.cc NTT
FFT.cc FFT
Bitwise-FFT.cc Bitwise FFT
FFT_chemthan.cc FFT chemthan
Interpolation_chemthan.cc Interpolation
BinaryVector.cc Binary vector space
DiophanteMod.cc DiophanteMod
BM.cc Berlekamp-Massey
LinearSieve.cc Linear Sieve
[Graph algorithms]
Arborescence.cc Arborescence
ArborescenceTrace.cc Arborescence With Trace
BridgesArticulations.cc Bridges and Articulations
BipartiteMatching.cc Bipartite Maximum Matching
Blossom.cc General Matching
DinicFlow.cc Dinic Flow
DinicFlowWithScaling.cc Dinic Flow With Scaling
Gomory_Hu.cc Gomory Hu Tree
MinCostMaxFlow.cc Min Cost-Max Flow
MinCostMaxFlowPotential.cc Min Cost Max Flow Potential
BoundedFlow.cc Bounded Feasible Flow
Hungarian.cc Hungarian Algorithm
MinCut.cc Undirected mincut
Eulerian.cc Eulerian Path/Circuit
TwoSAT.cc 2-SAT
SPFA.cc SPFA
[Data structures]
Treap.cc Treap
BigInt.cc Big Integer
ITConvexHull.cc Convex Hull IT
LinkCutTree.cc Link Cut Tree
OrderedSet.cc Ordered Set
Unordered_map.cc Unordered Map
[Miscellaneous]
RNG.cc RNG
SQRT_forloop.cc SQRT forloop