NTPU_codebook/content.tex at main · bsbacon0966/NTPU_codebook · GitHub

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
\section{Basic}

\subsection{compile}
\lstinputlisting{Basic/compile.txt}
\subsection{default code}
\lstinputlisting{Basic/default.cpp}
\subsection{debug list}
\lstinputlisting{Basic/bug_list.txt}

\section{Dark Code}

\subsection{IO optimization}
\lstinputlisting{DarkCode/IO_optimization.cpp}

\section{Geometry}

\subsection{2D point}
\lstinputlisting{Geometry/2Dpoint.cpp}
\subsection{Convex Hull}
\lstinputlisting{Geometry/ConvexHull.cpp}

\section{Flow}

\subsection{Dinic}
\lstinputlisting{Flow/dinic.cpp}
\subsection{min cost flow}
\lstinputlisting{Flow/Min_Cost_Max_Flow.cpp}

\section{Mathmatics}

\subsection{ax+by=gcd(a,b)}
\lstinputlisting{Math/ax+by=gcd.cpp}
\subsection{BigInt}
\lstinputlisting{Math/Bigint.cpp}
\subsection{GaussElimination}
\lstinputlisting{Math/GaussElimination.cpp}
\subsection{Inverse}
\lstinputlisting{Math/Inverse.cpp}
\subsection{LinearPrime}
\lstinputlisting{Math/LinearPrime.cpp}
\subsection{Miller Rabin}
\lstinputlisting{Math/Miller-Rabin.cpp}
\subsection{Pollard's rho}
\lstinputlisting{Math/pollardRho.cpp}
\subsection{數論基本工具}
\lstinputlisting{Math/number_tool.cpp}
\subsection{Mobius}
\lstinputlisting{Math/Mobius.cpp}
\subsection{SG}
\lstinputlisting{Math/Sprague-Grundy.cpp}
\subsection{Theorem}
\lstinputlisting{Math/theorem.cpp}


\section{Graph}

\subsection{BCC}
\lstinputlisting{Graph/BCC_edge.cpp}
\subsection{Prim}
\lstinputlisting{Graph/Prim.cpp}
\subsection{Bellman Ford}
\lstinputlisting{Graph/Bellman_ford.cpp}
\subsection{Kruskal}
\lstinputlisting{Graph/Kruskal.cpp}
\subsection{Dijkstra}
\lstinputlisting{Graph/Dijkstra.cpp}
\subsection{Strongly Connected Component(SCC)}
\lstinputlisting{Graph/Kosaraju_SCC.cpp}
\subsection{Hungarian}
\lstinputlisting{Graph/Matching/Hungarian.cpp}
\subsection{KM}
\lstinputlisting{Graph/Matching/Kuhn_Munkres.cpp}
\subsection{最小平均環}
\lstinputlisting{Graph/Min_mean_cycle.cpp}
\subsection{偵測負環}
\lstinputlisting{Graph/negative_cycle_validation.cpp}
\subsection{Tarjan}
\lstinputlisting{Graph/Tarjan.cpp}
\subsection{Topological Sort}
\lstinputlisting{Graph/Topological_Sort.cpp}

\section{Data Structure}

\subsection{2D Range Tree}
\lstinputlisting{DataStructure/2D_RangeTree.cpp}
\subsection{Sparse Table}
\lstinputlisting{DataStructure/SparseTable.h}
\subsection{Segment Tree}
\lstinputlisting{DataStructure/Segment_tree.cpp}
\subsection{Lazy Tag}
\lstinputlisting{DataStructure/Lazy_tag.cpp}


\section{String}

\subsection{KMP}
\lstinputlisting{String/KMP.h}
\subsection{smallest rotation}
\lstinputlisting{String/smallest_rotation.cpp}
\subsection{Suffix Array}
\lstinputlisting{String/suffix_array.cpp}
\subsection{Z-value}
\lstinputlisting{String/Z-value.cpp}

\section{Others}

\subsection{矩陣數定理}
\lstinputlisting{Other/count_spanning_tree.cpp}
\subsection{1D/1D dp 優化}
\lstinputlisting{Other/Dp1D1D.cpp}
\subsection{Theorm - DP optimization}
\lstinputlisting{Other/DP-optimization.txt}
\subsection{Stable Marriage}
\lstinputlisting{Other/Marriage.cpp}
\subsection{python 小抄}
\lstinputlisting{Other/python.py}


\section{Persistence}