MCPcopy Create free account

hub / github.com/Ashishgup1/Competitive-Coding / functions

Functions289 in github.com/Ashishgup1/Competitive-Coding

Methodirrelevant
Convex Hull (Dynamic).cpp:51
MethodisParallel
Convex Hull (Dynamic).cpp:21
FunctionisRectangleAnyOrder
Checks if ABCD form a rectangle, in any orientation
Geometry.cpp:25
FunctionisSquareAnyOrder
Checks if ABCD form a square, in any orientation
Geometry.cpp:37
FunctionkruskalMST
Kruskal's MST.cpp:66
Functionleast_rotation
String Rotation (Booth's Algorithm).cpp:3
Methodmax_flow
MaxFlow - Push Relabel [V^3].cpp:92
Methodmax_flow
MaxFlow - Push Relabel [V^2 sqrt(E)].cpp:71
Methodmax_matching
Matching (Hopcroft-Karp) in Bipartite Graph.cpp:68
Methodmaxxor
Trie.cpp:44
Methodmerge
Write reqd merge functions
Segment Tree.cpp:26
Methodmerge
Treap.cpp:109
Methodmerge
Gaussian Elimination.cpp:57
MethodminCostFlow
Min Cost Max Flow - Dijkstra.cpp:57
Functionmo
Mo's Algorithm.cpp:40
Functionmod_power
FFT (Iterative).cpp:380
Functionmodular_inverse
Extended Euclidean Algorithm (Extensive).cpp:16
Functionmultiply
FFT (Iterative).cpp:226
Functionmultiply
FFT (Recursive).cpp:42
Methodmycomplex<float_t>
FFT (Iterative).cpp:11
FunctionnCr
Factorials with nCr.cpp:37
FunctionnegativeCycle
Negative Cycles in Directed Graph.cpp:8
Methodnode
Trie.cpp:8
Methodoperation
Treap.cpp:72
Methodoperator *
Matrix Struct.cpp:49
Methodoperator +
Convex Hull (Graham's Scan).cpp:21
Methodoperator +
Matrix Struct.cpp:36
Methodoperator -
Convex Hull (Graham's Scan).cpp:27
Methodoperator -
2 Closest Points in 2D Plane (N log^2 N).cpp:5
Methodoperator <
Convex Hull (Graham's Scan).cpp:14
Methodoperator =
Convex Hull (Graham's Scan).cpp:9
Methodoperator*
FFT (Iterative).cpp:25
Methodoperator+
FFT (Iterative).cpp:22
Methodoperator+
Sweep Line: Intersecting Line Segments.cpp:27
Methodoperator-
FFT (Iterative).cpp:23
Methodoperator-
Sweep Line: Intersecting Line Segments.cpp:32
Functionoperator<
Sweep Line: Intersecting Line Segments.cpp:168
Methodoperator<
Sweep Line: Intersecting Line Segments.cpp:37
Methodoperator<
Sweep Line: Intersecting Line Segments.cpp:133
Methodoperator<
Convex Hull (Dynamic).cpp:29
MethodpQuery
Segment Tree.cpp:74
MethodpUpdate
Segment Tree.cpp:106
Functionparallel_binary
Parallel Binary Search.cpp:56
FunctionpersistentSegTree
Persistent Segment Tree.cpp:47
Methodpoint
Convex Hull (Graham's Scan).cpp:5
Functionpower
Matrix Struct.cpp:67
Functionprecompute
Factorials with nCr.cpp:21
Functionprecompute
LCA (with Time Traversal DFS).cpp:29
Functionprecompute
Sparse Matrix (RMQ).cpp:5
Functionprecompute
Tree Construction with Specific Vertices.cpp:20
Methodpref
BIT - Binary Indexed Tree (Fenwick Tree).cpp:21
MethodprefMax
BIT - Binary Indexed Tree (Fenwick Tree).cpp:62
FunctionprimsMST
Prim's MST.cpp:7
Methodpropagate
Handle lazy propagation appriopriately
Segment Tree.cpp:32
Methodpush
MaxFlow - Push Relabel [V^2 sqrt(E)].cpp:32
Functionquery
Persistent Segment Tree.cpp:34
Functionquery
SQRT Decomposition.cpp:133
Methodquery
Segment Tree.cpp:125
Functionquery_hld
Heavy Light Decomposition (HLD).cpp:184
Methodrelabel
MaxFlow - Push Relabel [V^3].cpp:52
Methodrelabel
MaxFlow - Push Relabel [V^2 sqrt(E)].cpp:43
Functionremove
Intervals Handling.cpp:16
Methodremove
Trie.cpp:33
Methodreset
Matrix Struct.cpp:22
Methodrsum
BIT - Binary Indexed Tree (Fenwick Tree).cpp:32
Functionscc
Strongly Connected Component.cpp:36
FunctionsccAddEdge
Strongly Connected Component.cpp:30
Methodsearch
BIT - Binary Indexed Tree (Fenwick Tree).cpp:39
MethodsemiQuery
SQRT Decomposition.cpp:75
MethodsemiUpdate
SQRT Decomposition.cpp:25
Functionsolve
Sweep Line: Intersecting Line Segments.cpp:187
Functionsolve
2 Closest Points in 2D Plane (N log^2 N).cpp:30
Methodsolve
2-SAT.cpp:43
Methodsplit
Treap.cpp:95
MethodsplitPos
Treap.cpp:81
Functionsquare
FFT (Iterative).cpp:165
Functiontoposort
Topological Sort.cpp:3
Methodtrie
Trie.cpp:18
Methodunite
DSU (Disjoint Set Union).cpp:29
Methodupdate
BIT - Binary Indexed Tree (Fenwick Tree).cpp:12
Methodupdate
Segment Tree.cpp:135
MethodupdateCnt
Treap.cpp:40
MethodupdateLeftBorder
Updates xValue of line pointed by it
Convex Hull (Dynamic).cpp:62
MethodupdateMax
BIT - Binary Indexed Tree (Fenwick Tree).cpp:53
Functionupdate_hld
Heavy Light Decomposition (HLD).cpp:201
Functionwalk
LCA (with Time Traversal DFS).cpp:19
Functionwalk
Heavy Light Decomposition (HLD).cpp:53
Functionwork
Tree Construction with Specific Vertices.cpp:58
Functionz_function
Z Algorithm.cpp:6
← previous201–289 of 289, ranked by callers