-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathcode.html
More file actions
384 lines (370 loc) · 24.4 KB
/
code.html
File metadata and controls
384 lines (370 loc) · 24.4 KB
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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
<!DOCTYPE html>
<html lang="ja">
<head>
<!-- Global site tag (gtag.js) - Google Analytics -->
<script async src="https://www.googletagmanager.com/gtag/js?id=UA-131511873-1"></script>
<script>
window.dataLayer = window.dataLayer || [];
function gtag(){dataLayer.push(arguments);}
gtag('js', new Date());
gtag('config', 'UA-131511873-1');
</script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({ tex2jax: { inlineMath: [['$','$'], ["\\(","\\)"]] } });
</script>
<script type="text/javascript"
src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.0/MathJax.js?config=TeX-AMS_CHTML">
</script>
<meta http-equiv="X-UA-Compatible" CONTENT="IE=EmulateIE7" />
$\newcommand{\O}{\mathrm{O}}$
<meta charset="UTF-8">
<meta http-equiv="X-UA-Compatible" content="IE=edge">
<title> My Algorithm : kopricky アルゴリズムライブラリ </title>
<meta name="viewport" content="width=device-width, initial-scale=1">
<meta name="description" content="競技プログラミングで使われるアルゴリズムのコード集">
<meta name="keywords" content="競技プログラミング,競プロ,アルゴリズム,コード,kopricky,computation,datastructure,geometry,graph,networkflow,string,icpc,Atcoder">
<link rel="stylesheet" href="css/style.css">
<script type="text/javascript" src="js/openclose.js"></script>
<link href="https://use.fontawesome.com/releases/v5.0.6/css/all.css" rel="stylesheet">
<link rel="shortcut icon" type="image/x-icon" href="favicon.ico">
<!--[if lt IE 9]>
<script src="https://oss.maxcdn.com/html5shiv/3.7.2/html5shiv.min.js"></script>
<script src="https://oss.maxcdn.com/respond/1.4.2/respond.min.js"></script>
<![endif]-->
</head>
<body>
<div id="container">
<header>
<h1 id="logo"><a href="index.html"><img src="images/logo.png" alt="kopricky アルゴリズムライブラリ"></a></h1>
</header>
<nav id="menubar">
<ul>
<li><a href="index.html">Home</a></li>
<li><a href="guide.html">Guide</a></li>
<li class="current"><a href="code.html">Code</a></li>
<li><a href="link.html">Link</a></li>
</ul>
</nav>
<div id="contents">
<section>
<h2>コード</h2>
<div class="accbox">
<!--ラベル1-->
<input type="checkbox" id="label1" class="cssacc" />
<label for="label1">Academic</label>
<div class="accshow">
<p id="code"><a href="code/Academic/bit_2d_rangeadd_rangesum.html"> BIT 2D RangeAdd RangeSum </a></p>
<p id="code"><a href="code/Academic/bit_vector.html"> Bit Vector </a></p>
<!-- <p id="code"><a href="code/Academic/c3_find.html"> $C_3$ Find Algorithm </a></p> -->
<p id="code"><a href="code/Academic/dijkstra_fheap.html"> Dijkstra with Fibonacci Heap </a></p>
<p id="code"><a href="code/Academic/dijkstra_rheap.html"> Dijkstra with Radix Heap </a></p>
<p id="code"><a href="code/Academic/dinic_dynamic_tree.html"> Dinic with Dynamic Tree </a></p>
<p id="code"><a href="code/Academic/dynamic_connectivity.html"> Dynamic Connectivity Algorithm </a></p>
<p id="code"><a href="code/Academic/exact_treewidth_*O(2^n).html"> Exact Treewidth *O(2^n) Algorithm </a></p>
<p id="code"><a href="code/Academic/exact_treewidth_pspace.html"> Exact Treewidth PSPACE Algorithm </a></p>
<p id="code"><a href="code/Academic/fibonacci_heap.html"> Fibonacci Heap </a></p>
<p id="code"><a href="code/Academic/finding_all_cycles.html"> Finding All Cycles </a></p>
<p id="code"><a href="code/Academic/finding_potential.html"> Finding Potential </a></p>
<p id="code"><a href="code/Academic/fully_retroactive_deque.html"> Fully Retroactive Deque </a></p>
<p id="code"><a href="code/Academic/fully_retroactive_union_find.html"> Fully Retroactive Union Find </a></p>
<p id="code"><a href="code/Academic/gale_sharpley.html"> Gale Sharpley </a></p>
<p id="code"><a href="code/Academic/irving.html"> Irving </a></p>
<p id="code"><a href="code/Academic/lineartime_rmq.html"> Lineartime RangeMinimumQuery </a></p>
<p id="code"><a href="code/Academic/lineartime_superbubble.html"> Lineartime Superbubble Algorithm </a></p>
<p id="code"><a href="code/Academic/make_heap_meldable.html"> Making Heaps Meldable </a></p>
<p id="code"><a href="code/Academic/maxflow_mincut_on_st-planar.html"> Maximum Flow Algorithm on st-Planar Graph </a></p>
<!-- <p id="code"><a href="code/Academic/min_cost_flow_with_negative_cycles.html"> Minimum Cost Flow Algorithm with Negative Cycles </a></p> -->
<p id="code"><a href="code/Academic/arborescence.html"> Minimum Arborescence Algorithm </a></p>
<p id="code"><a href="code/Academic/rapid_mst.html"> O(m log log n)-time MST </a></p>
<p id="code"><a href="code/Academic/parallel_quick_sort.html"> Parallel Quick Sort </a></p>
<p id="code"><a href="code/Academic/partial_persistent_linked_data_structure.html"> Partial Persistent Linked Data Structure </a></p>
<p id="code"><a href="code/Academic/prim_fheap.html"> Prim with Fibonacci Heap </a></p>
<p id="code"><a href="code/Academic/max_flow_push_relabel.html"> Push Relabel </a></p>
<p id="code"><a href="code/Academic/random_graph_generator.html"> Random Graph Generator </a></p>
<p id="code"><a href="code/Academic/steiner_tree.html"> Steiner Tree </a></p>
<p id="code"><a href="code/Academic/undirected_mincut.html"> Undirected Minimum Cut Algorithm </a></p>
<p id="code"><a href="code/Academic/maximum_matching.html">Unweighted Maximum Matching Algorithm </a></p>
<p id="code"><a href="code/Academic/van_emde_boas_tree.html"> van Emde Boas Tree </a></p>
</div>
<!--//ラベル1-->
<!--ラベル2-->
<input type="checkbox" id="label2" class="cssacc" />
<label for="label2">Binary Search Tree</label>
<div class="accshow">
<p id="code"><a href="code/BinarySearchTree/rbst_query.html"> RBST Query </a></p>
<p id="code"><a href="code/BinarySearchTree/rbst_set.html"> RBST Set </a></p>
<p id="code"><a href="code/BinarySearchTree/scapegoat_tree.html"> Scapegoat Tree </a></p>
<p id="code"><a href="code/BinarySearchTree/splay_tree.html"> Splay Tree </a></p>
<p id="code"><a href="code/BinarySearchTree/treap.html"> Treap </a></p>
</div>
<!--//ラベル2-->
<!--ラベル3-->
<input type="checkbox" id="label3" class="cssacc" />
<label for="label3">Classic Problem</label>
<div class="accshow">
<p id="code"><a href="code/ClassicProblem/distinct_substrings.html"> Counting the Number of Distinct Substrings </a></p>
<p id="code"><a href="code/ClassicProblem/c4_find.html"> $C_4$ Find Algorithm </a></p>
<p id="code"><a href="code/ClassicProblem/limited_knapsack.html"> Limited Knapsack Algorithm </a></p>
<p id="code"><a href="code/ClassicProblem/longest_palindrome_sequence.html"> Finding the Longest Palindrome Sequence </a></p>
</div>
<!--//ラベル3-->
<!--ラベル4-->
<input type="checkbox" id="label4" class="cssacc" />
<label for="label4">Computation (Basic)</label>
<div class="accshow">
<p id="code"><a href="code/Computation_Basic/all_prime_factorize.html"> All Prime Factorize </a></p>
<p id="code"><a href="code/Computation_Basic/mod_combination.html"> MOD Combination </a></p>
<p id="code"><a href="code/Computation_Basic/mod_inverse.html"> MOD Inverse </a></p>
<p id="code"><a href="code/Computation_Basic/next_combination.html"> Next Combination </a></p>
<p id="code"><a href="code/Computation_Basic/zeller.html"> Zeller </a></p>
</div>
<!--//ラベル4-->
<!--ラベル5-->
<input type="checkbox" id="label5" class="cssacc" />
<label for="label5">Computation (Advanced)</label>
<div class="accshow">
<p id="code"><a href="code/Computation_Advanced/01_knapsack_bound_branch.html"> 01 Knapsack Branch and Bound </a></p>
<p id="code"><a href="code/Computation_Advanced/two_sat.html"> 2 SAT Algorithm </a></p>
<p id="code"><a href="code/Computation_Advanced/babystep_giantstep.html"> Baby Step Giant Step Algorithm </a></p>
<p id="code"><a href="code/Computation_Advanced/crt.html"> Chinese Remainder Theorem </a></p>
<p id="code"><a href="code/Computation_Advanced/continued_fraction.html"> Continued Fraction Algorithm </a></p>
<p id="code"><a href="code/Computation_Advanced/fast_mobius_transform.html"> Fast Mobius Transform </a></p>
<p id="code"><a href="code/Computation_Advanced/fast_zeta_transform.html"> Fast Zeta Transform </a></p>
<p id="code"><a href="code/Computation_Advanced/garner.html"> Garner Algorithm </a></p>
<p id="code"><a href="code/Computation_Advanced/inversion_count.html"> Inversion Count Algorithm </a></p>
<p id="code"><a href="code/Computation_Advanced/lagrange_interpolation.html"> Lagrange Interpolation </a></p>
<!-- <p id="code"><a href="code/Computation_Advanced/mapping_12_phase.html"> Mapping 12 Phase </a></p> -->
<p id="code"><a href="code/Computation_Advanced/miller_rabbin.html"> Miller Rabbin </a></p>
<p id="code"><a href="code/Computation_Advanced/multipoint_evaluation.html"> Multipoint Evaluation </a></p>
<p id="code"><a href="code/Computation_Advanced/polynomial_interpolation.html"> Polynomial Interpolation </a></p>
<p id="code"><a href="code/Computation_Advanced/recurrence_formula_solver.html"> Recurrence Formula Solver </a></p>
<p id="code"><a href="code/Computation_Advanced/slide_min.html"> Slide Min Algorithm </a></p>
<p id="code"><a href="code/Computation_Advanced/tetration.html"> Tetration </a></p>
</div>
<!--//ラベル5-->
<input type="checkbox" id="label6" class="cssacc" />
<label for="label6">Data Structure (Basic)</label>
<div class="accshow">
<p id="code"><a href="code/DataStructure_Basic/bit.html"> Binary Indexed Tree (Fenwick Tree) </a></p>
<p id="code"><a href="code/DataStructure_Basic/bit_1d_rangeadd_rangesum.html">BIT 1D RangeAddQuery and RangeSumQuery</a></p>
<p id="code"><a href="code/DataStructure_Basic/binary_trie.html"> Binary Trie </a></p>
<p id="code"><a href="code/DataStructure_Basic/merge_tech.html"> Merge Tech </a></p>
<p id="code"><a href="code/DataStructure_Basic/sparse_table.html"> Sparse Table </a></p>
<!-- <p id="code"><a href="code/DataStructure_Basic/sqrt_decomposition.html"> Sqrt Decomposition </a></p> -->
<p id="code"><a href="code/DataStructure_Basic/trie.html"> Trie </a></p>
<p id="code"><a href="code/DataStructure_Basic/update_interval.html"> Update Interval </a></p>
</div>
<input type="checkbox" id="label7" class="cssacc" />
<label for="label7">Data Structure (Advanced)</label>
<div class="accshow">
<p id="code"><a href="code/DataStructure_Advanced/bit_2d.html"> BIT 2D </a></p>
<p id="code"><a href="code/DataStructure_Advanced/compressed_trie.html"> Compressed Trie (Patricia Trie) </a></p>
<p id="code"><a href="code/DataStructure_Advanced/convex_hull_trick.html"> Convex Hull Trick </a></p>
<p id="code"><a href="code/DataStructure_Advanced/dynamic_convex_hull_trick.html"> Dynamic Convex Hull Trick </a></p>
<p id="code"><a href="code/DataStructure_Advanced/lis_2d.html"> 2D Decreasing Sequence </a></p>
<p id="code"><a href="code/DataStructure_Advanced/skew_heap.html"> Skew Heap </a></p>
<p id="code"><a href="code/DataStructure_Advanced/sparse_table_2D.html"> Sparse Table 2D </a></p>
<p id="code"><a href="code/DataStructure_Advanced/mo_algorithm.html"> Mo algorithm </a></p>
<p id="code"><a href="code/DataStructure_Advanced/wavelet_matrix.html"> Wavelet Matrix </a></p>
</div>
<input type="checkbox" id="label8" class="cssacc" />
<label for="label8">Data Structure (OnGraph)</label>
<div class="accshow">
<p id="code"><a href="code/DataStructure_OnGraph/euler_tour_tree.html"> Euler Tour Tree </a></p>
<p id="code"><a href="code/DataStructure_OnGraph/hl_decomposition.html"> HL Decomposition </a></p>
<p id="code"><a href="code/DataStructure_OnGraph/lca.html"> Lowest Common Ancester </a></p>
<p id="code"><a href="code/DataStructure_OnGraph/link_cut_tree.html"> Link Cut Tree </a></p>
<p id="code"><a href="code/DataStructure_OnGraph/partial_persistent_union_find.html"> Partial Persistent Union Find </a></p>
<p id="code"><a href="code/DataStructure_OnGraph/union_find.html"> Union Find </a></p>
<p id="code"><a href="code/DataStructure_OnGraph/weighted_union_find.html"> Weighted Union Find </a></p>
</div>
<input type="checkbox" id="label9" class="cssacc" />
<label for="label9">FFTs (Polynomial)</label>
<div class="accshow">
<p id="code"><a href="code/FFTs/fft.html"> Fast Fourier Transform </a></p>
<p id="code"><a href="code/FFTs/fwht.html"> Fast Walsh Hadamard Transform </a></p>
<p id="code"><a href="code/FFTs/ntt.html"> Number Theoretic Transform </a></p>
<p id="code"><a href="code/FFTs/polynomial_division.html"> Polynomial Division </a></p>
<p id="code"><a href="code/FFTs/polynomial_exp.html"> Polynomial Exponential </a></p>
<p id="code"><a href="code/FFTs/polynomial_inverse.html"> Polynomial Inverse </a></p>
<p id="code"><a href="code/FFTs/polynomial_log.html"> Polynomial Logarithm </a></p>
</div>
<!-- <input type="checkbox" id="label10" class="cssacc" /> -->
<!-- <label for="label10">Geometry (準備中)</label> -->
<!-- <div class="accshow">
<p id="code"><a href="#"> all_in </a></p>
<p id="code"><a href="#"> area </a></p>
<p id="code"><a href="#"> basic </a></p>
<p id="code"><a href="#"> closest_pair </a></p>
<p id="code"><a href="#"> convex </a></p>
<p id="code"><a href="#"> crosspoint </a></p>
<p id="code"><a href="#"> distance </a></p>
<p id="code"><a href="#"> intersect </a></p>
<p id="code"><a href="#"> line </a></p>
<p id="code"><a href="#"> slope </a></p>
<p id="code"><a href="#"> tangent </a></p>
<p id="code"><a href="#"> voronoi </a></p>
</div> -->
<input type="checkbox" id="label11" class="cssacc" />
<label for="label11">Graph</label>
<div class="accshow">
<p id="code"><a href="code/Graph/centroid.html"> Centroid Find Algorithm </a></p>
<p id="code"><a href="code/Graph/chromatic_number.html"> Chromaticr Number Algorithm </a></p>
<p id="code"><a href="code/Graph/CountingC4.html"> Counting $C_4$ </a></p>
<!-- <p id="code"><a href="code/Graph/directed_minimum_mean_weight_cycle.html"> Directed Minimum Mean Weight Cycle Algorithm</a></p> -->
<p id="code"><a href="code/Graph/dual_graph.html"> Constructing Dual Graph </a></p>
<p id="code"><a href="code/Graph/eldos_gallai.html"> Eldös Gallai's Theorem </a></p>
<p id="code"><a href="code/Graph/EnumeratingC3.html"> Enumerating $C_3$ </a></p>
<p id="code"><a href="code/Graph/euler_tour.html"> Euler Tour Algorithm </a></p>
<p id="code"><a href="code/Graph/euler_trail.html"> Eulerian Trail Algorithm </a></p>
<p id="code"><a href="code/Graph/havel_hakimi.html"> Havel-Hakimi </a></p>
<p id="code"><a href="code/Graph/maximum_independent_set.html"> Maximum Independent Set Algorithm </a></p>
<p id="code"><a href="code/Graph/minimum_vertex_cover.html"> Minimum Vertex Cover Algorithm </a></p>
<p id="code"><a href="code/Graph/topological_sort.html"> Topological sort </a></p>
<p id="code"><a href="code/Graph/tree_diameter.html"> Tree Diameter Algorithm </a></p>
<p id="code"><a href="code/Graph/tree_isomorphism.html"> Tree Isomorphism </a></p>
</div>
<input type="checkbox" id="label12" class="cssacc" />
<label for="label12">Graph Decomposition</label>
<div class="accshow">
<p id="code"><a href="code/GraphDecomposition/articulation.html"> Articulation Node Find Algorithm(Constructing Block Cut Tree) </a></p>
<p id="code"><a href="code/GraphDecomposition/bridge.html"> Bridge Find Algorithm </a></p>
<p id="code"><a href="code/GraphDecomposition/centroid_decomposition.html"> Centroid Decomposition </a></p>
<p id="code"><a href="code/GraphDecomposition/functional_graph.html"> Functional Graph </a></p>
<p id="code"><a href="code/GraphDecomposition/namori.html"> Namori </a></p>
<p id="code"><a href="code/GraphDecomposition/strongly_connected_component.html"> Strongly Connected Component Algorithm </a></p>
</div>
<input type="checkbox" id="label13" class="cssacc" />
<label for="label13">Graph (SP, MST)</label>
<div class="accshow">
<p id="code"><a href="code/Graph_SP_MST/bellman_ford.html"> Bellman Ford </a></p>
<p id="code"><a href="code/Graph_SP_MST/boruvka.html"> Boruvka </a></p>
<p id="code"><a href="code/Graph_SP_MST/dijkstra.html"> Dijkstra </a></p>
<p id="code"><a href="code/Graph_SP_MST/kruskal.html"> Kruskal </a></p>
<p id="code"><a href="code/Graph_SP_MST/prim.html"> Prim </a></p>
<p id="code"><a href="code/Graph_SP_MST/warshall_floyd.html"> Warshall Floyd </a></p>
</div>
<input type="checkbox" id="label15" class="cssacc" />
<label for="label15">Matrix</label>
<div class="accshow">
<p id="code"><a href="code/Matrix/bit_matrix.html"> Bit Matrix </a></p>
<p id="code"><a href="code/Matrix/matrix.html"> Matrix </a></p>
</div>
<input type="checkbox" id="label16" class="cssacc" />
<label for="label16">Misc</label>
<div class="accshow">
<p id="code"><a href="code/Misc/dice.html"> Dice </a></p>
<p id="code"><a href="code/Misc/erase_outer_inner_interval.html"> Erase Outer Inner Interval </a></p>
<p id="code"><a href="code/Misc/input_output_rapid.html"> Input Output Rapid </a></p>
<p id="code"><a href="code/Misc/int128.html"> Int128 </a></p>
<!-- <p id="code"><a href="code/Misc/loop_unrolling.html"> Loop Unrolling </a></p> -->
<p id="code"><a href="code/Misc/hash_function.html"> Hash Function </a></p>
<p id="code"><a href="code/Misc/runge_kutta.html"> Runge Kutta </a></p>
</div>
<input type="checkbox" id="label18" class="cssacc" />
<label for="label18">Network Flow</label>
<div class="accshow">
<p id="code"><a href="code/NetworkFlow/bipartite_matching.html"> Bipartite Matching Algorithm </a></p>
<p id="code"><a href="code/NetworkFlow/dinic.html"> Dinic Algorithm </a></p>
<p id="code"><a href="code/NetworkFlow/hungarian.html"> Hungarian </a></p>
<!-- <p id="code"><a href="code/NetworkFlow/limited_mincap_maxflow.html"> Maximum flow Algorithm with Minimum Capacity Constraints </a></p> -->
<p id="code"><a href="code/NetworkFlow/min_cost_flow.html"> Minimum Cost Flow Algorithm </a></p>
<p id="code"><a href="code/NetworkFlow/min_cost_flow_DAG.html"> Minimum Cost Flow Algorithm on DAG </a></p>
</div>
<input type="checkbox" id="label17" class="cssacc" />
<label for="label17">Original Container</label>
<div class="accshow">
<p id="code"><a href="code/OriginalContainer/list.html"> List </a></p>
<p id="code"><a href="code/OriginalContainer/map.html"> Map </a></p>
<p id="code"><a href="code/OriginalContainer/set.html"> Set </a></p>
<p id="code"><a href="code/OriginalContainer/unordered_map.html"> Unordered Map </a></p>
<p id="code"><a href="code/OriginalContainer/unordered_set.html"> Unordered Set </a></p>
</div>
<input type="checkbox" id="label24" class="cssacc" />
<label for="label24">Original Type</label>
<div class="accshow">
<p id="code"><a href="code/OriginalType/accuracy_multi_precision.html"> Accuracy Multi Precision </a></p>
<p id="code"><a href="code/OriginalType/multi_precision_integer.html"> Multi Precision Integer </a></p>
<p id="code"><a href="code/OriginalType/rational_number.html"> Rational Number </a></p>
</div>
<!-- <input type="checkbox" id="label19" class="cssacc" /> -->
<!-- <label for="label19">Persistent Data Structure (準備中)</label> -->
<!-- <div class="accshow">
<p id="code"><a href="#"> persistent_array </a></p>
<p id="code"><a href="#"> persistent_rbst_set </a></p>
<p id="code"><a href="#"> persistent_unionfind </a></p>
<p id="code"><a href="#"> persistent_segtree </a></p>
</div> -->
<input type="checkbox" id="label20" class="cssacc" />
<label for="label20">Segment Trees</label>
<div class="accshow">
<input type="checkbox" id="label21" class="cssacc" />
<label for="label21">Basic</label>
<div class="accshow">
<p id="code"><a href="code/SegmentTrees/Basic/rangeaddquery_and_rangeminquery.html"> RangeAddQuery and RangeMinQuery </a></p>
<p id="code"><a href="code/SegmentTrees/Basic/rangeaddquery_and_rangesumquery.html"> RangeAddQuery and RangeSumQuery </a></p>
<p id="code"><a href="code/SegmentTrees/Basic/rangeandupdatequery_rangeorupdatequery_and_rangeminquery.html"> RangeAndUpdateQuery RangeOrUpdateQuery and RangeMinQuery </a></p>
<p id="code"><a href="code/SegmentTrees/Basic/rangemaxupdatequery_and_rangesumquery.html"> RangeMaxupdateQuery and RangeSumQuery </a></p>
<p id="code"><a href="code/SegmentTrees/Basic/rangeupdatequery_rangeaddquery_and_rangesumquery.html"> RangeUpdateQuery RangeAddQuery and RangeSumQuery </a></p>
<p id="code"><a href="code/SegmentTrees/Basic/rangeupdatequery_rangemoduloquery_and_rangesumquery.html"> RangeUpdateQuery RangeModuloQuery and RangeSumQuery </a></p>
<!-- <p id="code"><a href="code/SegmentTrees/Basic/segtree_abstract.html"> Segtree Abstract </a></p> -->
<p id="code"><a href="code/SegmentTrees/Basic/segtree_nonrecursion.html"> Segtree Nonrecursion </a></p>
<p id="code"><a href="code/SegmentTrees/Basic/segtree.html"> Segtree </a></p>
<p id="code"><a href="code/SegmentTrees/Basic/static_rangemexquery.html"> StaticRangeMexQuery </a></p>
</div>
<!-- <p id="code"><a href="code/SegmentTrees/dynamic_segtree.html"> Dynamic Segtree </a></p> -->
<p id="code"><a href="code/SegmentTrees/merge_segtree.html"> Merge Segtree </a></p>
<p id="code"><a href="code/SegmentTrees/orthogonal_range_report.html"> Orthogonal RangeReport </a></p>
<p id="code"><a href="code/SegmentTrees/rangetree_pointupdate.html"> Rangetree PointUpdate </a></p>
</div>
<input type="checkbox" id="label22" class="cssacc" />
<label for="label22">String</label>
<div class="accshow">
<p id="code"><a href="code/String/kmp.html"> Knuth Morrison Pratt </a></p>
<p id="code"><a href="code/String/manacher.html"> Manacher </a></p>
<p id="code"><a href="code/String/mp.html"> Morrison Pratt </a></p>
<p id="code"><a href="code/String/z_algorithm.html"> Z Algorithm </a></p>
<!-- <div class="accshow">
<p id="code"><a href="code/String/aho_corasick.html"> aho_corasick </a></p>
<p id="code"><a href="code/String/rolling_hash.html"> rolling_hash </a></p>
<p id="code"><a href="code/String/rolling_hash_2d.html"> rolling_hash_2d </a></p>
<p id="code"><a href="code/String/suffix_array_lcp.html"> suffix_array_lcp </a></p>
</div> -->
</div>
<input type="checkbox" id="label23" class="cssacc" />
<label for="label23">Syntax Analysis</label>
<div class="accshow">
<p id="code"><a href="code/SyntaxAnalysis/parser.html"> Calculating a Numerical Expression with the Four Basic Arithmetic Operations </a></p>
<p id="code"><a href="code/SyntaxAnalysis/syntax_tree.html"> Constructing the Syntax Tree </a></p>
<!-- <p id="code"><a href="code/preparation.html"> Syntax Range Parser </a></p> -->
</div>
<input type="checkbox" id="label26" class="cssacc" />
<label for="label26">Asobiba</label>
<div class="accshow">
<p id="code"><a href="code/Asobiba/bipartite_matching_under_range_edges.html"> Bipartite Matching on Range Edges </a></p>
<p id="code"><a href="code/Asobiba/path_subtree_query_plus_ball_query.html"> Path Query / Subtree Query + Ball Query </a></p>
<p id="code"><a href="code/Asobiba/path_add_path_sum_with_centroid_decomposition.html"> Path Add Path Sum with Centroid Decomposition </a></p>
</div>
<input type="checkbox" id="label25" class="cssacc" />
<label for="label25">For Python</label>
<div class="accshow">
<p id="code"><a href="code/For_Python/bipartite_matching.html"> Bipartite Matching </a></p>
<p id="code"><a href="code/For_Python/bit.html"> Binary Indexed Tree </a></p>
<p id="code"><a href="code/For_Python/dijkstra.html"> Dijkstra </a></p>
<p id="code"><a href="code/For_Python/kruskal.html"> Kruskal </a></p>
<p id="code"><a href="code/For_Python/max_flow.html"> Max Flow </a></p>
<p id="code"><a href="code/For_Python/priority_queue.html"> Priority Queue </a></p>
<p id="code"><a href="code/For_Python/union_find.html"> Union Find </a></p>
</div>
</div><!--//.accbox-->
</section>
</div>
<!--/contents-->
<footer>
<small>Copyright© <a href="index.html"> My Algorithm : kopricky アルゴリズムライブラリ </a> All Rights Reserved.</small>
<span class="pr">《<a href="https://template-party.com/" target="_blank">Web Design:Template-Party</a>》</span>
</footer>
</div>
<!--/container-->
</body>
</html>