MCPcopy Create free account

hub / github.com/ShahjalalShohag/code-library / functions

Functions3,514 in github.com/ShahjalalShohag/code-library

Method_add
Graph Theory/2 SAT.cpp:46
Method_add_val
Data Structures/Segment Tree Beats.cpp:151
Method_query_max
Data Structures/Segment Tree Beats.cpp:178
Method_query_min
Data Structures/Segment Tree Beats.cpp:191
Method_query_sum
Data Structures/Segment Tree Beats.cpp:204
Method_update_max
Data Structures/Segment Tree Beats.cpp:117
Method_update_min
Data Structures/Segment Tree Beats.cpp:104
Method_update_val
Data Structures/Segment Tree Beats.cpp:164
Methodaccess
make the path from root to u a preferred path returns last path-parent of a node as it moves up the tree
Data Structures/Link Cut Tree.cpp:89
Methodadd
Geometry/Geometry 2D.cpp:483
Methodadd
Miscellaneous/Maximum of Sum of All Pair Distances of K nodes in a Tree.cpp:39
Methodadd
Game Theory/Blue Red Hackenbush.cpp:68
Methodadd
Data Structures/Venice Technique.cpp:7
Methodadd
Graph Theory/Hafnian of a Matrix.cpp:36
Methodadd
Graph Theory/Edge Coloring Bipartite Graph Faster.cpp:25
MethodaddOR
(x_a or (not x_b))-> af=1,bf=0
Graph Theory/2 SAT.cpp:33
MethodaddXOR
(!x_a xor !x_b)-> af=0, bf=0
Graph Theory/2 SAT.cpp:42
Methodadd_blossom
Graph Theory/Blossom Algorithm Weighted.cpp:88
Methodadd_clause
Graph Theory/3 SAT.cpp:22
Methodadd_edge
Graph Theory/Min Cost Max Flow with Negative Cycles.cpp:26
Methodadd_edge
Graph Theory/L R Flow with MCMF.cpp:129
Methodadd_edge
Graph Theory/L R Flow with Dinic.cpp:89
Methodadd_edge
Graph Theory/LCA in O(1).cpp:44
Methodadd_edge
Graph Theory/Maximum Closure Problem.cpp:92
Methodadd_flow
Graph Theory/Min Cost Max Flow with Negative Cycles.cpp:38
Methodadd_line
Dynamic Programming Optimizations/Li Chao Tree.cpp:76
Methodadd_mod
Number Theory/Sum of nCi for a Fixed Large n.cpp:176
Methodadd_segment
y = mx + b: x in [l, r]
Dynamic Programming Optimizations/Li Chao Tree.cpp:80
Methodadd_word
Strings/Aho Corasick Dynamic.cpp:23
Methodaddall
Data Structures/Segment Tree Beats.cpp:130
Methodadvance_bottom
Data Structures/Queue Undo Trick.cpp:83
Methodaho_corasick
Strings/Aho Corasick Dynamic.cpp:84
Methodaho_corasick_static
Strings/Aho Corasick Dynamic.cpp:18
Methodamul
Number Theory/Sum of nCi for a Fixed Large n.cpp:376
Methodangle
Geometry/Geometry 2D.cpp:467
Functionangle_bisector
bisector vector of <abc
Geometry/Geometry 2D.cpp:180
Functionare_lines_same
check if two lines are same
Geometry/Geometry 2D.cpp:175
Methodarea
Geometry/Geometry 2D.cpp:298
Methodarea
Geometry/Geometry 2D.cpp:1280
Methodarea
Geometry/Geometry 3D.cpp:392
Functionarea_of_triangle
Geometry/Geometry 2D.cpp:555
Methodarg
Dynamic Programming Optimizations/DP on Convex Hulls.cpp:22
Methodarg
Geometry/Voronoi Diagram.cpp:133
Methodarg
Geometry/Geometry 3D.cpp:28
Methodarg
Geometry/Half Plane Intersection.cpp:25
Methodarg
Geometry/Half Plane Intersection Dynamic.cpp:25
Methodarg
Geometry/All Pair Segment Intersection.cpp:56
Methodat
Data Structures/Segment Tree with Arithmetic Progression.cpp:39
Methodaugment
Game Theory/Matching Game On A Graph.cpp:26
Methodaugment
Graph Theory/Blossom Algorithm.cpp:26
Methodaugment
Graph Theory/Blossom Algorithm Weighted.cpp:70
Methodbad
Dynamic Programming Optimizations/Convex Hull Trick.cpp:17
Methodbad
Dynamic Programming Optimizations/Dynamic Convex Hull Trick.cpp:28
Methodbase
Math/NTT With Any Prime MOD.cpp:8
Methodbase
Math/Polynomial.cpp:8
Methodbase
Math/Subset Sum Problem.cpp:8
Methodbase
Math/Faulhaber Formula Fastest.cpp:8
Methodbase
Math/Linear Recurrence Fastest.cpp:8
Methodbase
Math/Cyclic Convolution.cpp:9
Methodbase
Math/FFT.cpp:9
Methodbase
Math/Lagrange Interpolation with Polynomial Extraction.cpp:8
Methodbase
Math/Polynomial with Binomial Coefficients.cpp:8
Methodbase
Math/NTT Online (D&C).cpp:8
Methodbase
Strings/String Matching With FFT.cpp:11
Methodbase
Number Theory/Prime Number System.cpp:28
Methodbase
Number Theory/Bell Number.cpp:8
Methodbase
Number Theory/Stirling Number of the Second Kind for Fixed k.cpp:8
Methodbase
Number Theory/Sum of C(a(i), k) for each k from 1 to n.cpp:8
Methodbase
Graph Theory/Number of Paths of Each Length in a Tree.cpp:9
Methodbase_area
Geometry/Geometry 3D.cpp:788
Methodbase_radius
radius of the base of the cap
Geometry/Geometry 3D.cpp:683
Methodbfs
Graph Theory/Tree Isomorphism.cpp:47
Methodbfs
Graph Theory/Dinics Algorithm.cpp:30
Methodbfs
Graph Theory/Unique Min Cut.cpp:30
Methodbfs
Graph Theory/L R Flow with Dinic.cpp:30
Methodbfs
Graph Theory/HopCroft Karp Algorithm.cpp:22
Methodbfs
Graph Theory/Maximum Closure Problem.cpp:30
Methodbfs
Graph Theory/Gomory Hu Tree.cpp:30
Methodbfs
Graph Theory/Maximum Density Subgraph.cpp:30
Methodbitflip
Graph Theory/Chromatic Polynoimial.cpp:55
Methodblossom
Game Theory/Matching Game On A Graph.cpp:47
Methodblossom
Graph Theory/Blossom Algorithm.cpp:47
Methodbs
Dynamic Programming Optimizations/Convex Hull Trick.cpp:45
Methodbuild
Geometry/Onion Decomposition.cpp:67
Methodbuild
Strings/String Hashing With Updates and Reverse.cpp:51
Methodbuild
Strings/Suffix Array Isomorphic.cpp:74
Methodbuild
Strings/Suffix Array Isomorphic.cpp:159
Methodbuild
Strings/Suffix Array.cpp:123
Methodbuild
Data Structures/Segment Tree.cpp:13
Methodbuild
Data Structures/SQRT Tree.cpp:72
Methodbuild
Data Structures/Segment Tree Lazy.cpp:29
Methodbuild
Graph Theory/LCA in O(1).cpp:48
MethodbuildBetween
Data Structures/SQRT Tree.cpp:43
MethodbuildBetweenZero
Data Structures/SQRT Tree.cpp:58
MethodbuildBlock
Data Structures/SQRT Tree.cpp:32
Methodbuild_tree
Strings/Suffix Automaton.cpp:72
Methodbuild_tree
Graph Theory/Articulation Bridges.cpp:44
Methodcan
is there any subset having xor = x
Math/Basis Vector.cpp:30
Methodcan
Number Theory/Linear Diophantine Equation with Nonnegative Solutions.cpp:34
Methodcan_exchange
can we insert elements[inserted_id] and remove elements[removed_id] without breaking independence?
Miscellaneous/Matroid Intersection Color Graphic Matroid.cpp:105
← previousnext →1,601–1,700 of 3,514, ranked by callers