@@ -50,213 +50,10 @@ markdown_extensions:
50
50
plugins :
51
51
- search
52
52
- macros
53
+ - literate-nav :
54
+ nav_file : navigation.md
53
55
54
56
extra :
55
57
analytics :
56
58
provider : google
57
- property : UA-85220282-1
58
- nav :
59
- - ' Home ' :
60
- - ' index.md'
61
- - ' navigation.md'
62
- - ' contrib.md'
63
- - ' preview.md'
64
- - ' Algebra ' :
65
- - ' Fundamentals ' :
66
- - ' algebra/binary-exp.md'
67
- - ' algebra/factoring-exp.md'
68
- - ' algebra/euclid-algorithm.md'
69
- - ' algebra/extended-euclid-algorithm.md'
70
- - ' algebra/linear-diophantine-equation.md'
71
- - ' algebra/fibonacci-numbers.md'
72
- - ' Prime numbers ' :
73
- - ' algebra/sieve-of-eratosthenes.md'
74
- - ' algebra/prime-sieve-linear.md'
75
- - ' algebra/primality_tests.md'
76
- - ' algebra/factorization.md'
77
- - ' Number-theoretic functions ' :
78
- - ' algebra/phi-function.md'
79
- - ' algebra/divisors.md'
80
- - ' Modular arithmetic ' :
81
- - ' algebra/module-inverse.md'
82
- - ' algebra/linear_congruence_equation.md'
83
- - ' algebra/chinese-remainder-theorem.md'
84
- - ' algebra/factorial-modulo.md'
85
- - ' algebra/discrete-log.md'
86
- - ' algebra/primitive-root.md'
87
- - ' algebra/discrete-root.md'
88
- - ' algebra/montgomery_multiplication.md'
89
- - ' Number systems ' :
90
- - ' algebra/balanced-ternary.md'
91
- - ' algebra/gray-code.md'
92
- - ' Miscellaneous ' :
93
- - ' algebra/all-submasks.md'
94
- - ' algebra/big-integer.md'
95
- - ' algebra/fft.md'
96
- - ' algebra/polynomial.md'
97
- - ' algebra/continued-fractions.md'
98
- - ' Data Structures ' :
99
- - ' Fundamentals ' :
100
- - ' data_structures/stack_queue_modification.md'
101
- - ' data_structures/sparse-table.md'
102
- - ' Trees ' :
103
- - ' data_structures/disjoint_set_union.md'
104
- - ' data_structures/fenwick.md'
105
- - ' data_structures/sqrt_decomposition.md'
106
- - ' data_structures/segment_tree.md'
107
- - ' data_structures/treap.md'
108
- - ' data_structures/sqrt-tree.md'
109
- - ' data_structures/randomized_heap.md'
110
- - ' Advanced ' :
111
- - ' data_structures/deleting_in_log_n.md'
112
- - ' Dynamic Programming ' :
113
- - ' DP optimizations ' :
114
- - ' dynamic_programming/divide-and-conquer-dp.md'
115
- - ' dynamic_programming/knuth-optimization.md'
116
- - ' Tasks ' :
117
- - ' dynamic_programming/profile-dynamics.md'
118
- - ' dynamic_programming/zero_matrix.md'
119
- - ' String Processing ' :
120
- - ' Fundamentals ' :
121
- - ' string/string-hashing.md'
122
- - ' string/rabin-karp.md'
123
- - ' string/prefix-function.md'
124
- - ' string/z-function.md'
125
- - ' string/suffix-array.md'
126
- - ' string/aho_corasick.md'
127
- - ' Advanced ' :
128
- - ' string/suffix-tree-ukkonen.md'
129
- - ' string/suffix-automaton.md'
130
- - ' string/lyndon_factorization.md'
131
- - ' Tasks ' :
132
- - ' string/expression_parsing.md'
133
- - ' string/manacher.md'
134
- - ' string/main_lorentz.md'
135
-
136
- - ' Linear Algebra ' :
137
- - ' Matrices ' :
138
- - ' linear_algebra/linear-system-gauss.md'
139
- - ' linear_algebra/determinant-gauss.md'
140
- - ' linear_algebra/determinant-kraut.md'
141
- - ' linear_algebra/rank-matrix.md'
142
- - ' Combinatorics ' :
143
- - ' Fundamentals ' :
144
- - ' algebra/factorial-divisors.md'
145
- - ' combinatorics/binomial-coefficients.md'
146
- - ' combinatorics/catalan-numbers.md'
147
- - ' Techniques ' :
148
- - ' combinatorics/inclusion-exclusion.md'
149
- - ' combinatorics/burnside.md'
150
- - ' combinatorics/stars_and_bars.md'
151
- - ' combinatorics/generating_combinations.md'
152
- - ' Tasks ' :
153
- - ' combinatorics/bishops-on-chessboard.md'
154
- - ' combinatorics/bracket_sequences.md'
155
- - ' combinatorics/counting_labeled_graphs.md'
156
- - ' Numerical Methods ' :
157
- - ' Search ' :
158
- - ' num_methods/ternary_search.md'
159
- - ' num_methods/roots_newton.md'
160
- - ' Integration ' :
161
- - ' num_methods/simpson-integration.md'
162
- - ' Geometry ' :
163
- - ' Elementary operations ' :
164
- - ' geometry/basic-geometry.md'
165
- - ' geometry/segment-to-line.md'
166
- - ' geometry/lines-intersection.md'
167
- - ' geometry/check-segments-intersection.md'
168
- - ' geometry/segments-intersection.md'
169
- - ' geometry/circle-line-intersection.md'
170
- - ' geometry/circle-circle-intersection.md'
171
- - ' geometry/tangents-to-two-circles.md'
172
- - ' geometry/length-of-segments-union.md'
173
- - ' Polygons ' :
174
- - ' geometry/oriented-triangle-area.md'
175
- - ' geometry/area-of-simple-polygon.md'
176
- - ' geometry/point-in-convex-polygon.md'
177
- - ' geometry/minkowski.md'
178
- - ' geometry/picks-theorem.md'
179
- - ' geometry/lattice-points.md'
180
- - ' Convex hull ' :
181
- - ' geometry/convex-hull.md'
182
- - ' geometry/convex_hull_trick.md'
183
- - ' Sweep-line ' :
184
- - ' geometry/intersecting_segments.md'
185
- - ' geometry/point-location.md'
186
- - ' Miscellaneous ' :
187
- - ' geometry/nearest_points.md'
188
- - ' geometry/delaunay.md'
189
- - ' geometry/vertical_decomposition.md'
190
- - ' geometry/halfplane-intersection.md'
191
- - ' Graphs ' :
192
- - ' Graph traversal ' :
193
- - ' graph/breadth-first-search.md'
194
- - ' graph/depth-first-search.md'
195
- - ' Connected components, bridges, articulations points ' :
196
- - ' graph/search-for-connected-components.md'
197
- - ' graph/bridge-searching.md'
198
- - ' graph/bridge-searching-online.md'
199
- - ' graph/cutpoints.md'
200
- - ' graph/strongly-connected-components.md'
201
- - ' graph/strong-orientation.md'
202
- - ' Single-source shortest paths ' :
203
- - ' graph/dijkstra.md'
204
- - ' graph/dijkstra_sparse.md'
205
- - ' graph/bellman_ford.md'
206
- - ' graph/01_bfs.md'
207
- - ' graph/desopo_pape.md'
208
- - ' All-pairs shortest paths ' :
209
- - ' graph/all-pair-shortest-path-floyd-warshall.md'
210
- - ' graph/fixed_length_paths.md'
211
- - ' Spanning trees ' :
212
- - ' graph/mst_prim.md'
213
- - ' graph/mst_kruskal.md'
214
- - ' graph/mst_kruskal_with_dsu.md'
215
- - ' graph/second_best_mst.md'
216
- - ' graph/kirchhoff-theorem.md'
217
- - ' graph/pruefer_code.md'
218
- - ' Cycles ' :
219
- - ' graph/finding-cycle.md'
220
- - ' graph/finding-negative-cycle-in-graph.md'
221
- - ' graph/euler_path.md'
222
- - ' Lowest common ancestor ' :
223
- - ' graph/lca.md'
224
- - ' graph/lca_binary_lifting.md'
225
- - ' graph/lca_farachcoltonbender.md'
226
- - ' graph/rmq_linear.md'
227
- - ' graph/lca_tarjan.md'
228
- - ' Flows and related problems ' :
229
- - ' graph/edmonds_karp.md'
230
- - ' graph/push-relabel.md'
231
- - ' graph/push-relabel-faster.md'
232
- - ' graph/dinic.md'
233
- - ' graph/mpm.md'
234
- - ' graph/flow_with_demands.md'
235
- - ' graph/min_cost_flow.md'
236
- - ' graph/Assignment-problem-min-flow.md'
237
- - ' Matchings and related problems ' :
238
- - ' graph/bipartite-check.md'
239
- - ' graph/kuhn_maximum_bipartite_matching.md'
240
- - ' Miscellaneous ' :
241
- - ' graph/topological-sort.md'
242
- - ' graph/edge_vertex_connectivity.md'
243
- - ' graph/tree_painting.md'
244
- - ' graph/2SAT.md'
245
- - ' graph/hld.md'
246
- - ' Miscellaneous ' :
247
- - ' Sequences ' :
248
- - ' sequences/rmq.md'
249
- - ' sequences/longest_increasing_subsequence.md'
250
- - ' others/maximum_average_segment.md'
251
- - ' sequences/k-th.md'
252
- - ' Game Theory ' :
253
- - ' game_theory/games_on_graphs.md'
254
- - ' game_theory/sprague-grundy-nim.md'
255
- - ' Schedules ' :
256
- - ' schedules/schedule_one_machine.md'
257
- - ' schedules/schedule_two_machines.md'
258
- - ' schedules/schedule-with-completion-duration.md'
259
- - ' Miscellaneous ' :
260
- - ' others/josephus_problem.md'
261
- - ' others/15-puzzle.md'
262
- - ' others/stern_brocot_tree_farey_sequences.md'
59
+ property : UA-85220282-1
0 commit comments