@@ -28,148 +28,148 @@ \subsection{Kuhn-Munkres (KM)}
2828\section {Grafos }
2929
3030\subsection {Dijkstra }
31- \lstinputlisting {graph /Dijkstra.cpp}
31+ \lstinputlisting {grafo /Dijkstra.cpp}
3232
3333\subsection {Bellman-Ford }
34- \lstinputlisting {graph /Bellman-Ford.cpp}
34+ \lstinputlisting {grafo /Bellman-Ford.cpp}
3535
3636\subsection {SPFA }
37- \lstinputlisting {graph /SPFA.cpp}
37+ \lstinputlisting {grafo /SPFA.cpp}
3838
3939\subsection {Floyd-Warshall }
40- \lstinputlisting {graph /Floyd-Warshall.cpp}
40+ \lstinputlisting {grafo /Floyd-Warshall.cpp}
4141
4242\subsection {Caminho Euleriano }
43- \lstinputlisting {graph /euler.cpp}
43+ \lstinputlisting {grafo /euler.cpp}
4444
4545\subsection {Componentes Biconexos (BCC) }
46- \lstinputlisting {graph /BccVertex.cpp}
46+ \lstinputlisting {grafo /BccVertex.cpp}
4747
4848\subsection {Componentes Fortemente Conexos (SCC) }
49- \lstinputlisting {graph /SCC.cpp}
49+ \lstinputlisting {grafo /SCC.cpp}
5050
5151\subsection {Clique Maximal }
52- \lstinputlisting {graph /MaximalClique.cpp}
52+ \lstinputlisting {grafo /MaximalClique.cpp}
5353
5454\subsection {Clique Máximo }
55- \lstinputlisting {graph /MaximumClique.cpp}
55+ \lstinputlisting {grafo /MaximumClique.cpp}
5656
5757\subsection {Ciclo de Média Mínima }
58- \lstinputlisting {graph /Minimum Mean Cycle.cpp}
58+ \lstinputlisting {grafo /Minimum Mean Cycle.cpp}
5959
6060\subsection {AGM Manhattan }
61- \lstinputlisting {graph /ManhattanMST.cpp}
61+ \lstinputlisting {grafo /ManhattanMST.cpp}
6262
6363
6464% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% PD %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
6565\section {Programação Dinâmica }
6666
6767\subsection {PD em dígitos }
68- \lstinputlisting {DP /digitDP.cpp}
68+ \lstinputlisting {PD /digitDP.cpp}
6969
7070\subsection {SOS DP }
71- \lstinputlisting {DP /SOSDP.cpp}
71+ \lstinputlisting {PD /SOSDP.cpp}
7272
7373
7474% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% MATEMÁTICA %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
7575\section {Matemática }
7676
7777\subsection {Fórmulas }
78- \lstinputlisting {math /Formula.txt}
78+ \lstinputlisting {matematica /Formula.txt}
7979
8080\subsection {Soma e multiplicação com \_\_ int128 }
81- \lstinputlisting {math /llladdmul.cpp}
81+ \lstinputlisting {matematica /llladdmul.cpp}
8282
8383\subsection {Primos }
84- \lstinputlisting {math /Primes.txt}
84+ \lstinputlisting {matematica /Primes.txt}
8585
8686\subsection {Pares coprimos }
87- \lstinputlisting {math /coprime.cpp}
87+ \lstinputlisting {matematica /coprime.cpp}
8888
8989\subsection {Exponenciação rápida }
90- \lstinputlisting {math /QuickPow.cpp}
90+ \lstinputlisting {matematica /QuickPow.cpp}
9191
9292\subsection {Exponenciação rápida de matrizes }
93- \lstinputlisting {math /MatPow.cpp}
93+ \lstinputlisting {matematica /MatPow.cpp}
9494
9595\subsection {Função totiente (φ) }
96- \lstinputlisting {math /phi.cpp}
96+ \lstinputlisting {matematica /phi.cpp}
9797
9898\subsection {Tabela de fatores }
99- \lstinputlisting {math /FactorTable.cpp}
99+ \lstinputlisting {matematica /FactorTable.cpp}
100100
101101\subsection {Números de Catalan }
102- \lstinputlisting {math /CatalanNumber.cpp}
102+ \lstinputlisting {matematica /CatalanNumber.cpp}
103103
104104\subsection {Teste de primalidade Miller-Rabin }
105- \lstinputlisting {math /MillerRabin.cpp}
105+ \lstinputlisting {matematica /MillerRabin.cpp}
106106
107107\subsection {Fatoração Pollard-Rho }
108- \lstinputlisting {math /PollardRho.cpp}
108+ \lstinputlisting {matematica /PollardRho.cpp}
109109
110110\subsection {Fatoração prima em O(log n) }
111- \lstinputlisting {math /PrimeFactorO(logn).cpp}
111+ \lstinputlisting {matematica /PrimeFactorO(logn).cpp}
112112
113113\subsection {Multiplicação O(1) com \_\_ int128 }
114- \lstinputlisting {math /O(1)mul.cpp}
114+ \lstinputlisting {matematica /O(1)mul.cpp}
115115
116116\subsection {Problema de Josefo (Josephus) }
117- \lstinputlisting {math /JosephusProblem.cpp}
117+ \lstinputlisting {matematica /JosephusProblem.cpp}
118118
119119\subsection {Soma harmônica }
120- \lstinputlisting {math /HarmonicSum.cpp}
120+ \lstinputlisting {matematica /HarmonicSum.cpp}
121121
122122\subsection {Contagem de Pólya }
123- \lstinputlisting {math /Polya.cpp}
123+ \lstinputlisting {matematica /Polya.cpp}
124124
125125\subsection {FFT (Transformada Rápida de Fourier) }
126- \lstinputlisting {math /FFT.cpp}
126+ \lstinputlisting {matematica /FFT.cpp}
127127
128128\subsection {Jogo de Grundy }
129- \lstinputlisting {math /GrundyGame.cpp}
129+ \lstinputlisting {matematica /GrundyGame.cpp}
130130
131131\subsection {Algoritmo de Euclides Estendido }
132- \lstinputlisting {math /Exgcd.cpp}
132+ \lstinputlisting {matematica /Exgcd.cpp}
133133
134134\subsection {Teorema Chinês do Resto (CRT) }
135- \lstinputlisting {math /CRT.cpp}
135+ \lstinputlisting {matematica /CRT.cpp}
136136
137137
138138% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% ESTRUTURAS DE DADOS %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
139139\section {Estruturas de Dados }
140140
141141\subsection {BIT (Árvore de Fenwick) }
142- \lstinputlisting {dataStructure /BIT.cpp}
142+ \lstinputlisting {estruturaDeDados /BIT.cpp}
143143
144144\subsection {BIT 2D }
145- \lstinputlisting {dataStructure /BIT2D.cpp}
145+ \lstinputlisting {estruturaDeDados /BIT2D.cpp}
146146
147147\subsection {Union-Find persistente }
148- \lstinputlisting {dataStructure /persistent_dsu.cpp}
148+ \lstinputlisting {estruturaDeDados /persistent_dsu.cpp}
149149
150150\subsection {Tabela esparsa (RMQ em O(1)) }
151- \lstinputlisting {dataStructure /Sparse Table.cpp}
151+ \lstinputlisting {estruturaDeDados /Sparse Table.cpp}
152152
153153\subsection {Árvore de Segmentos }
154- \lstinputlisting {dataStructure /SegmentTree.cpp}
154+ \lstinputlisting {estruturaDeDados /SegmentTree.cpp}
155155
156156\subsection {Árvore de Segmentos dinâmica }
157- \lstinputlisting {dataStructure /dinamicSegmentTree.cpp}
157+ \lstinputlisting {estruturaDeDados /dinamicSegmentTree.cpp}
158158
159159\subsection {Árvore de Segmentos dinâmica 2D }
160- \lstinputlisting {dataStructure /dinamicSegmentTree2D.cpp}
160+ \lstinputlisting {estruturaDeDados /dinamicSegmentTree2D.cpp}
161161
162162\subsection {Árvore de Segmentos persistente }
163- \lstinputlisting {dataStructure /persistent_seg_tree.cpp}
163+ \lstinputlisting {estruturaDeDados /persistent_seg_tree.cpp}
164164
165165\subsection {Árvore de Segmentos temporal }
166- \lstinputlisting {dataStructure /TimeSegmentTree.cpp}
166+ \lstinputlisting {estruturaDeDados /TimeSegmentTree.cpp}
167167
168168\subsection {Treap (BST aleatória) }
169- \lstinputlisting {dataStructure /Treap.cpp}
169+ \lstinputlisting {estruturaDeDados /Treap.cpp}
170170
171171\subsection {PBDS (Policy-Based Data Structures) }
172- \lstinputlisting {dataStructure /PBDS.cpp}
172+ \lstinputlisting {estruturaDeDados /PBDS.cpp}
173173
174174
175175% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% STRINGS %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
@@ -210,136 +210,117 @@ \subsection{Subsequências distintas}
210210\section {Árvores }
211211
212212\subsection {LCA (Menor Ancestral Comum) }
213- \lstinputlisting {tree /LCA.cpp}
213+ \lstinputlisting {arvore /LCA.cpp}
214214
215215\subsection {Hash de árvore }
216- \lstinputlisting {tree /TreeHash.cpp}
216+ \lstinputlisting {arvore /TreeHash.cpp}
217217
218218\subsection {Decomposição Pesada-Leve (HLD) }
219- \lstinputlisting {tree /heavyLightDecomposition.cpp}
219+ \lstinputlisting {arvore /heavyLightDecomposition.cpp}
220220
221221
222222% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% GEOMETRIA %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
223223\section {Geometria }
224224
225225\subsection {Definições 2D }
226- \lstinputlisting {geometry /2DDefinition.cpp}
226+ \lstinputlisting {geometria /2DDefinition.cpp}
227227
228228\subsection {Definições 3D }
229- \lstinputlisting {geometry /3DDefinition.cpp}
229+ \lstinputlisting {geometria /3DDefinition.cpp}
230230
231231\subsection {Definição de reta }
232- \lstinputlisting {geometry /LineDefinition.cpp}
232+ \lstinputlisting {geometria /LineDefinition.cpp}
233233
234234\subsection {Operações básicas }
235- \lstinputlisting {geometry /Basic.cpp}
235+ \lstinputlisting {geometria /Basic.cpp}
236236
237237\subsection {Área do polígono }
238- \lstinputlisting {geometry /PolygonArea.cpp}
238+ \lstinputlisting {geometria /PolygonArea.cpp}
239239
240240\subsection {Ponto dentro do polígono }
241- \lstinputlisting {geometry /IsPointInPolygon.cpp}
241+ \lstinputlisting {geometria /IsPointInPolygon.cpp}
242242
243243\subsection {Fecho convexo }
244- \lstinputlisting {geometry /ConvexHull.cpp}
244+ \lstinputlisting {geometria /ConvexHull.cpp}
245245
246246\subsection {Soma de Minkowski }
247- \lstinputlisting {geometry /MinkowskiSum.cpp}
247+ \lstinputlisting {geometria /MinkowskiSum.cpp}
248248
249249\subsection {Distância mais curta entre polígonos }
250- \lstinputlisting {geometry /PolygonDistance.cpp}
250+ \lstinputlisting {geometria /PolygonDistance.cpp}
251251
252252\subsection {Truque do fecho convexo (CHT) }
253- \lstinputlisting {geometry /ConvexHullTrick.cpp}
253+ \lstinputlisting {geometria /ConvexHullTrick.cpp}
254254
255255\subsection {Ordenação polar }
256- \lstinputlisting {geometry /PolarSort.cpp}
256+ \lstinputlisting {geometria /PolarSort.cpp}
257257
258258\subsection {Teorema de Pick }
259- \lstinputlisting {geometry /PickTheorm.cpp}
259+ \lstinputlisting {geometria /PickTheorm.cpp}
260260
261261\subsection {Par de pontos mais próximos }
262- \lstinputlisting {geometry /ShortestPair.cpp}
262+ \lstinputlisting {geometria /ShortestPair.cpp}
263263
264264\subsection {Par de pontos mais distantes }
265- \lstinputlisting {geometry /FarthestPair.cpp}
265+ \lstinputlisting {geometria /FarthestPair.cpp}
266266
267267\subsection {Mediana geométrica (Weiszfeld) }
268- \lstinputlisting {geometry /Weiszfeld.cpp}
268+ \lstinputlisting {geometria /Weiszfeld.cpp}
269269
270270\subsection {Linha de varredura }
271- \lstinputlisting {geometry /SweepLine.cpp}
271+ \lstinputlisting {geometria /SweepLine.cpp}
272272
273273\subsection {Interseção círculo-polígono }
274- \lstinputlisting {geometry /CircleIntersect.cpp}
274+ \lstinputlisting {geometria /CircleIntersect.cpp}
275275
276276\subsection {Tangentes a dois círculos }
277- \lstinputlisting {geometry /TangantLineOf2Circle.cpp}
277+ \lstinputlisting {geometria /TangantLineOf2Circle.cpp}
278278
279279\subsection {Interseção de dois círculos }
280- \lstinputlisting {geometry /PCIntersect.cpp}
280+ \lstinputlisting {geometria /PCIntersect.cpp}
281281
282282\subsection {Cobertura de círculo }
283- \lstinputlisting {geometry /CircleCover.cpp}
283+ \lstinputlisting {geometria /CircleCover.cpp}
284284
285285\subsection {Círculo mínimo envolvente }
286- \lstinputlisting {geometry /Mec.cpp}
286+ \lstinputlisting {geometria /Mec.cpp}
287287
288288\subsection {Esfera mínima envolvente }
289- \lstinputlisting {geometry /Mec.cpp}
289+ \lstinputlisting {geometria /Mec.cpp}
290290
291291\subsection {Retângulo envolvente de área mínima/máxima }
292- \lstinputlisting {geometry /MinMaxEnclosingRectangle.cpp}
292+ \lstinputlisting {geometria /MinMaxEnclosingRectangle.cpp}
293293
294294\subsection {Interseção de semiplanos }
295- \lstinputlisting {geometry /HalfPlaneIntersection.cpp}
295+ \lstinputlisting {geometria /HalfPlaneIntersection.cpp}
296296
297297\subsection {União de polígonos }
298- \lstinputlisting {geometry /PolyUnion.cpp}
298+ \lstinputlisting {geometria /PolyUnion.cpp}
299299
300300\subsection {Cobertura de polígonos }
301- \lstinputlisting {geometry /PolyCover.cpp}
301+ \lstinputlisting {geometria /PolyCover.cpp}
302302
303303\subsection {Pontos notáveis do triângulo }
304- \lstinputlisting {geometry /Triangle.cpp}
304+ \lstinputlisting {geometria /Triangle.cpp}
305305
306306
307307% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% PROBLEMAS ESPECIAIS %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
308308\section {Problemas Especiais }
309309
310310\subsection {Contagem de substrings }
311- \lstinputlisting {SpecialQuestion /ContainString.cpp}
311+ \lstinputlisting {problemasEspeciais /ContainString.cpp}
312312
313313\subsection {Ordem parcial 3D }
314- \lstinputlisting {SpecialQuestion /Partiallyordered3D.cpp}
314+ \lstinputlisting {problemasEspeciais /Partiallyordered3D.cpp}
315315
316316\subsection {LCS cíclico }
317- \lstinputlisting {SpecialQuestion /CyclicLCS.cpp}
317+ \lstinputlisting {problemasEspeciais /CyclicLCS.cpp}
318318
319319\subsection {Simulated Annealing (têmpera simulada) }
320- \lstinputlisting {SpecialQuestion /Simulated annealing.cpp}
320+ \lstinputlisting {problemasEspeciais /Simulated annealing.cpp}
321321
322322\subsection {Raiz quadrada discreta }
323- \lstinputlisting {SpecialQuestion/DiscreteSqrt.cpp}
324-
325-
326- % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% PYTHON %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
327- \section {Python }
328-
329- \subsection {Data e hora (datetime) }
330- \lstinputlisting {python/datetime.py}
331-
332- \subsection {Decimal }
333- \lstinputlisting {python/Decimal.py}
334-
335- \subsection {Fração (Fraction) }
336- \lstinputlisting {python/Fraction.py}
337-
338- \subsection {Expressões regulares (re) }
339- \lstinputlisting {python/re.py}
340-
341- \subsection {Diversos }
342- \lstinputlisting {python/Misc.py}
323+ \lstinputlisting {problemasEspeciais/DiscreteSqrt.cpp}
343324
344325
345326% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% PAPEL MILIMETRADO PARA RASCUNHO %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
0 commit comments