forked from gabrielpessoa1/ICPC-Library
-
Notifications
You must be signed in to change notification settings - Fork 0
/
contents.txt
59 lines (52 loc) · 2.2 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
# Any line followed by a '#' character is ignored
# Section headings must be in square brackets
# Subsections within a section should follow the format:
# [filename within code directory][tab character \t][subsection title]
# tab character:
[String Algorithms]
String/StringAlignment.cpp String Alignment
String/KMP.cpp KMP
String/Trie.cpp Trie
String/Aho-Corasick.cpp Aho-Corasick
[Data Structures]
DataStructures/BIT.cpp BIT - Binary Indexed Tree
DataStructures/SegmentTreeIterative.cpp Iterative Segment Tree
DataStructures/SegmentTreeIterativeReversed.cpp Iterative Segment Tree with Interval Updates
DataStructures/SegmentTree.cpp Recursive Segment Tree
DataStructures/SegmentTreeLazy.cpp Segment Tree with Lazy Propagation
DataStructures/ColorUpdate.cpp Color Updates Structure
DataStructures/PolicyBased.cpp Policy Based Structures
DataStructures/HLD.cpp Heavy Light Decomposition
[Graph Algorithms]
#Graph/DFS.cpp DFS / Toposort
#Graph/BFS.cpp BFS / Shortest Path in a Unweighted Graph
#Graph/Dijkstra.cpp Dijkstra / Shortest Path in a Weighted Graph
#Graph/Floyd-Warshall.cpp Floyd-Warshall / Shortest path between all pairs
#Graph/Disjoint-Set.cpp Disjoint-Set / Union-Find
#Graph/Kruskal.cpp Kruskal's MST - Minimum Spanning Tree
Graph/Dinic.cpp Dinic Max Flow
Graph/BiconnectedComponents.cpp Articulation Points/Bridges/Biconnected Components
Graph/SCC.cpp SCC - Strongly Connected Components / 2SAT
Graph/LCA.cpp LCA - Lowest Common Ancestor
Graph/Sack.cpp Sack
[Math]
Math/DiscreteLog.cpp Discrete Logarithm
Math/GCD.cpp GCD - Greatest Common Divisor
Math/ExtendedEuclides.cpp Extended Euclides
Math/FastExp.cpp Fast Exponentiation
Math/MatrixFastExp.cpp Matrix Fast Exponentiation
Math/FFT.cpp FFT - Fast Fourier Transform
[Geometry]
Geometry/Geometry.cpp Geometry
Geometry/ConvexHull.cpp Convex Hull
Geometry/ClosestPair.cpp ClosestPair
Geometry/IntersectionPoints.cpp Intersection Points
#Geometry/MaxSegOverlap.cpp Maximum Segments Overlap (Sweep Line)
[Miscellaneous]
Miscellaneous/LIS.cpp LIS - Longest Increasing Subsequence
Miscellaneous/BinarySearch.cpp Binary Search
Miscellaneous/TernarySearch.cpp Ternary Search
[Teoremas e formulas uteis]
Theorems/Graph.txt Grafos
Theorems/Math.txt Math
Theorems/Geometry.txt Geometry