MCPcopy Create free account

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

Functions289 in github.com/Ashishgup1/Competitive-Coding

⨍ Functions 289◇ Types & classes 35
↓ 59 callersMethodsize
Gaussian Elimination.cpp:17
↓ 18 callersMethodpush
Treap.cpp:46
↓ 16 callersMethoderase
Treap.cpp:138
↓ 14 callersFunctionmerge
Kruskal's MST.cpp:36
↓ 12 callersMethodinsert
Trie.cpp:20
↓ 11 callersMethodreal
FFT (Iterative).cpp:13
↓ 9 callersFunctionpropagate
Heavy Light Decomposition (HLD).cpp:118
↓ 8 callersMethodclear
Treap.cpp:162
↓ 8 callersFunctionnext
Sweep Line: Intersecting Line Segments.cpp:182
↓ 8 callersFunctionprev
Sweep Line: Intersecting Line Segments.cpp:177
↓ 8 callersFunctionshift_solution
Extended Euclidean Algorithm (Extensive).cpp:29
↓ 7 callersMethodimag
FFT (Iterative).cpp:14
↓ 6 callersFunctionfft_iterative
FFT (Iterative).cpp:113
↓ 6 callersFunctiongetBCC
Biconnected Components (Online Bridge).cpp:18
↓ 5 callersFunctionextract
FFT (Iterative).cpp:128
↓ 5 callersFunctionupdate
SQRT Decomposition.cpp:125
↓ 4 callersFunctionclear
Parallel Binary Search.cpp:4
↓ 4 callersFunctiondfs
DSU On Trees.cpp:39
↓ 4 callersFunctionisRectangle
Checks if ABCD form a rectangle (in that order)
Geometry.cpp:19
↓ 4 callersFunctionrt
Kruskal's MST.cpp:26
↓ 4 callersFunctionvec
Sweep Line: Intersecting Line Segments.cpp:143
↓ 3 callersFunctionLCA
Heavy Light Decomposition (HLD).cpp:71
↓ 3 callersFunctionadd
DSU On Trees.cpp:19
↓ 3 callersFunctionbuild
Persistent Segment Tree.cpp:4
↓ 3 callersFunctiondfs1
Heavy Light Decomposition (HLD).cpp:23
↓ 3 callersMethoddist
2 Closest Points in 2D Plane (N log^2 N).cpp:10
↓ 3 callersFunctionfft
FFT (Recursive).cpp:19
↓ 3 callersFunctionintersect
Sweep Line: Intersecting Line Segments.cpp:160
↓ 3 callersFunctionisOrthogonal
Checks if angle ABC is a right angle
Geometry.cpp:13
↓ 3 callersFunctionisSquare
Checks if ABCD form a square (in that order)
Geometry.cpp:31
↓ 3 callersFunctionround_up_power_two
FFT (Iterative).cpp:60
↓ 2 callersFunctionadd
Mo's Algorithm.cpp:26
↓ 2 callersFunctionadd
Matrix Struct.cpp:1
↓ 2 callersMethodbetween
Sweep Line: Intersecting Line Segments.cpp:20
↓ 2 callersFunctionccw
Convex Hull (Graham's Scan).cpp:63
↓ 2 callersFunctioncw
Convex Hull (Graham's Scan).cpp:57
↓ 2 callersFunctiondfs2
Bridge Tree in Graph.cpp:31
↓ 2 callersFunctiondist
Finds squared euclidean distance between two points
Geometry.cpp:7
↓ 2 callersFunctionget
Heavy Light Decomposition (HLD).cpp:166
↓ 2 callersFunctiongetComp
Biconnected Components (Online Bridge).cpp:27
↓ 2 callersFunctionget_length
Given n (a power of two), finds k such that n == 1 << k.
FFT (Iterative).cpp:68
↓ 2 callersMethodget_y
Sweep Line: Intersecting Line Segments.cpp:116
↓ 2 callersFunctionintersect1D
Sweep Line: Intersecting Line Segments.cpp:151
↓ 2 callersFunctioninvert_fft
FFT (Iterative).cpp:142
↓ 2 callersFunctionis_power_of_two
FFT (Iterative).cpp:56
↓ 2 callersFunctionmod_multiply
FFT (Iterative).cpp:282
↓ 2 callersFunctionpow
Discrete Logarithm.cpp:4
↓ 2 callersFunctionprepare_roots
FFT (Iterative).cpp:90
↓ 2 callersFunctionquery_up
Heavy Light Decomposition (HLD).cpp:172
↓ 2 callersFunctionremove
Mo's Algorithm.cpp:33
↓ 2 callersMethodreset
Treap.cpp:66
↓ 2 callersFunctionupd
Heavy Light Decomposition (HLD).cpp:161
↓ 2 callersFunctionupdate_up
Heavy Light Decomposition (HLD).cpp:191
↓ 2 callersFunctionwork
Parallel Binary Search.cpp:35
↓ 2 callersFunctionxgcd
Extended Euclidean Algorithm (Extensive).cpp:1
↓ 1 callersFunctionLCA
LCA (with Time Traversal DFS).cpp:37
↓ 1 callersFunctionLCA
Tree Construction with Specific Vertices.cpp:28
↓ 1 callersFunctionMakeRoot
Biconnected Components (Online Bridge).cpp:76
↓ 1 callersFunctionapply
Parallel Binary Search.cpp:9
↓ 1 callersFunctionbfs
BFS.cpp:6
↓ 1 callersFunctionbit_reorder
FFT (Iterative).cpp:76
↓ 1 callersFunctionbuild
Heavy Light Decomposition (HLD).cpp:105
↓ 1 callersFunctioncentroid
Centroid Decomposition.cpp:18
↓ 1 callersFunctioncheck
Parallel Binary Search.cpp:21
↓ 1 callersFunctioncomputeans
DSU On Trees.cpp:33
↓ 1 callersFunctiondfs
Articulation Points.cpp:10
↓ 1 callersFunctiondfs
Strongly Connected Component.cpp:8
↓ 1 callersFunctiondfs
Centroid Decomposition.cpp:5
↓ 1 callersFunctiondfs
Heavy Light Decomposition (HLD).cpp:11
↓ 1 callersFunctiondfs2
Strongly Connected Component.cpp:19
↓ 1 callersFunctiondfs_hld
Heavy Light Decomposition (HLD).cpp:37
↓ 1 callersFunctiondp
Digit DP.cpp:7
↓ 1 callersFunctionfindLoop
DFS - Cycle Detection in Directed Graph.cpp:1
↓ 1 callersFunctionfind_any_solution
Extended Euclidean Algorithm (Extensive).cpp:35
↓ 1 callersFunctiongetRand
Treap.cpp:3
↓ 1 callersFunctioninit
Kruskal's MST.cpp:16
↓ 1 callersMethodinit
SQRT Decomposition.cpp:12
↓ 1 callersFunctioninit_fft
FFT (Recursive).cpp:8
↓ 1 callersMethodintersect
Sweep Line: Intersecting Line Segments.cpp:70
↓ 1 callersFunctionisancestor
Tree Construction with Specific Vertices.cpp:53
↓ 1 callersMethodmakeiden
Matrix Struct.cpp:27
↓ 1 callersFunctionmergePath
Biconnected Components (Online Bridge).cpp:34
↓ 1 callersFunctionmodinv
Factorials with nCr.cpp:16
↓ 1 callersFunctionmult
Matrix Struct.cpp:9
↓ 1 callersFunctionmypolar
FFT (Iterative).cpp:43
↓ 1 callersMethodorder_of_key
Treap.cpp:191
↓ 1 callersMethodparallel
Sweep Line: Intersecting Line Segments.cpp:65
↓ 1 callersFunctionpow
Factorials with nCr.cpp:3
↓ 1 callersFunctionpow
Primitive Root.cpp:4
↓ 1 callersFunctionprecompute
Heavy Light Decomposition (HLD).cpp:63
↓ 1 callersMethodpush
MaxFlow - Push Relabel [V^3].cpp:40
↓ 1 callersFunctionquery
Heavy Light Decomposition (HLD).cpp:129
↓ 1 callersMethodquery
SQRT Decomposition.cpp:100
↓ 1 callersFunctiontotient
Primitive Root.cpp:17
↓ 1 callersFunctionupdate
Persistent Segment Tree.cpp:15
↓ 1 callersFunctionupdate
Heavy Light Decomposition (HLD).cpp:143
↓ 1 callersMethodupdate
SQRT Decomposition.cpp:67
↓ 1 callersMethodvalueAt
Convex Hull (Dynamic).cpp:17
MethodConvexHullDynamic
Convex Hull (Dynamic).cpp:74
MethodEvent
Sweep Line: Intersecting Line Segments.cpp:129
next →1–100 of 289, ranked by callers