Skip to content

Commit

Permalink
update README to match with notebook
Browse files Browse the repository at this point in the history
  • Loading branch information
iagorrr authored and github-actions[bot] committed Aug 19, 2024
1 parent cfedf3a commit 7db0aa8
Showing 1 changed file with 46 additions and 49 deletions.
95 changes: 46 additions & 49 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -7,6 +7,7 @@
#### Contest
- [bash config](/content/Contest/bash%20config.sh)
- [debug](/content/Contest/debug.cpp)
- [run](/content/Contest/run.cpp)
- [short template](/content/Contest/short-template.cpp)
- [template](/content/Contest/template.cpp)
- [vim config](/content/Contest/vim%20config.vim)
Expand All @@ -15,65 +16,62 @@

#### Data Structures
- Segment Tree (Dynamic)
- [Range Query Max Point Max Assign](/content/Data%20Structures/Segment%20Tree%20(Dynamic)/Range%20Query%20Max%20Point%20Max%20Assign.cpp)
- [Range Query Sum Point Sum Update](/content/Data%20Structures/Segment%20Tree%20(Dynamic)/Range%20Query%20Sum%20Point%20Sum%20Update.cpp)
- [Range query sum point sum update](/content/Data%20Structures/Segment%20tree%20(dynamic)/Range%20query%20sum%20point%20sum%20update.cpp)
- [Range query max point max assign](/content/Data%20Structures/Segment%20tree%20(dynamic)/Range%20query%20max%20point%20max%20assign.cpp)

- Segment Tree Point Update (Bottom Up)
- [Query Min](/content/Data%20Structures/Segment%20Tree%20Point%20Update%20(bottom%20up)/Query%20Min.cpp)
- [Query GCD](/content/Data%20Structures/Segment%20Tree%20Point%20Update%20(bottom%20up)/Query%20GCD.cpp)
- [Query Sum](/content/Data%20Structures/Segment%20Tree%20Point%20Update%20(bottom%20up)/Query%20Sum.cpp)
- [Query Max Subarray Sum](/content/Data%20Structures/Segment%20Tree%20Point%20Update%20(bottom%20up)/Query%20Max%20Subarray%20Sum.cpp)

- Segment Tree Point Update (Top Dow)
- [Query Hash](/content/Data%20Structures/Segment%20Tree%20Point%20Update%20(top-dow)/Query%20Hash.cpp)
- [Query Sum](/content/Data%20Structures/Segment%20Tree%20Point%20Update%20(top-dow)/Query%20Sum.cpp)
- Segment Tree Point Update Range Query
- [Query GCD (bottom up)](/content/Data%20Structures/Segment%20tree%20point%20update%20range%20query/Query%20GCD%20(bottom%20up).cpp)
- [Query sum (bottom up)](/content/Data%20Structures/Segment%20tree%20point%20update%20range%20query/Query%20sum%20(bottom%20up).cpp)
- [Query min (bottom up)](/content/Data%20Structures/Segment%20tree%20point%20update%20range%20query/Query%20min%20(bottom%20up).cpp)
- [Query hash (top down)](/content/Data%20Structures/Segment%20tree%20point%20update%20range%20query/Query%20hash%20(top%20down).cpp)
- [Query max subarray sum (bottom up)](/content/Data%20Structures/Segment%20tree%20point%20update%20range%20query/Query%20max%20subarray%20sum%20(bottom%20up).cpp)

- Segment Tree Range Update Range Query
- [set and increment update sum query](/content/Data%20Structures/Segment%20tree%20range%20update%20range%20query/set-and-increment-update-sum-query.cpp)
- [Arithmetic progression sum update query sum](/content/Data%20Structures/Segment%20tree%20range%20update%20range%20query/Arithmetic%20progression%20sum%20update%20query%20sum.cpp)
- [Increment Update Query Max (bottom up)](/content/Data%20Structures/Segment%20tree%20range%20update%20range%20query/Increment%20Update%20Query%20Max%20(bottom%20up).cpp)
- [Increment update query max (bottom up)](/content/Data%20Structures/Segment%20tree%20range%20update%20range%20query/Increment%20update%20query%20max%20(bottom%20up).cpp)
- [Increment update sum query (top down)](/content/Data%20Structures/Segment%20tree%20range%20update%20range%20query/Increment%20update%20sum%20query%20(top%20down).cpp)
- [Arithmetic progression sum update query sum (top down)](/content/Data%20Structures/Segment%20tree%20range%20update%20range%20query/Arithmetic%20progression%20sum%20update%20query%20sum%20(top%20down).cpp)

- Sqrt Decomposition
- [two sequence queries](/content/Data%20Structures/SQRT%20Decomposition/two-sequence-queries.cpp)
- [two sequence queries](/content/Data%20Structures/SQRT%20decomposition/two-sequence-queries.cpp)

- [Bitree 2D](/content/Data%20Structures/Bitree%202D.cpp)
- [Convex Hull Trick](/content/Data%20Structures/Convex%20Hull%20Trick.cpp)
- [Convex hull trick](/content/Data%20Structures/Convex%20hull%20trick.cpp)
- [DSU](/content/Data%20Structures/DSU.cpp)
- [Lichao Tree Dynamic](/content/Data%20Structures/Lichao%20Tree%20Dynamic.cpp)
- [Merge Sort Tree](/content/Data%20Structures/Merge%20Sort%20Tree.cpp)
- [Mex With Update](/content/Data%20Structures/Mex%20With%20Update.cpp)
- [Ordered Set (GNU PBDS)](/content/Data%20Structures/Ordered%20Set%20(GNU%20PBDS).cpp)
- [Prefix Sum 2D](/content/Data%20Structures/Prefix%20Sum%202D.cpp)
- [Venice Set](/content/Data%20Structures/Venice%20Set.cpp)
- [Wavelet Tree](/content/Data%20Structures/Wavelet%20Tree.cpp)
- [Lichao tree dynamic](/content/Data%20Structures/Lichao%20tree%20dynamic.cpp)
- [Merge sort tree](/content/Data%20Structures/Merge%20sort%20tree.cpp)
- [Mex with update](/content/Data%20Structures/Mex%20with%20update.cpp)
- [Ordered set (GNU PBDS)](/content/Data%20Structures/Ordered%20set%20(GNU%20PBDS).cpp)
- [Prefix sum 2D](/content/Data%20Structures/Prefix%20sum%202D.cpp)
- [Venice set](/content/Data%20Structures/Venice%20set.cpp)
- [Wavelet tree](/content/Data%20Structures/Wavelet%20tree.cpp)



#### Dynamic Programming
- [Binary Knapsack](/content/Dynamic%20Programming/Binary%20Knapsack.cpp)
- [Edit Distance](/content/Dynamic%20Programming/Edit%20Distance.cpp)
- [Binary knapsack](/content/Dynamic%20Programming/Binary%20knapsack.cpp)
- [Edit distance](/content/Dynamic%20Programming/Edit%20distance.cpp)
- [Knapsack](/content/Dynamic%20Programming/Knapsack.cpp)
- [Longest Increasing Subsequence](/content/Dynamic%20Programming/Longest%20Increasing%20Subsequence.cpp)
- [Money Sum](/content/Dynamic%20Programming/Money%20Sum.cpp)
- [Travelling Salesman Problem](/content/Dynamic%20Programming/Travelling%20Salesman%20Problem.cpp)
- [Longest increasing subsequence](/content/Dynamic%20Programming/Longest%20increasing%20subsequence.cpp)
- [Money sum](/content/Dynamic%20Programming/Money%20sum.cpp)
- [Travelling salesman problem](/content/Dynamic%20Programming/Travelling%20salesman%20problem.cpp)



#### Extras
- [ int128t stream](/content/Extras/__int128t%20stream.cpp)
- [Binary to Gray](/content/Extras/Binary%20to%20Gray.cpp)
- [Get Permutation Cycles](/content/Extras/Get%20Permutation%20Cycles.cpp)
- [Max & Min Check](/content/Extras/Max%20&%20Min%20Check.cpp)
- [Binary to gray](/content/Extras/Binary%20to%20gray.cpp)
- [Get permutation cycles](/content/Extras/Get%20permutation%20cycles.cpp)
- [Max & min check](/content/Extras/Max%20&%20min%20check.cpp)
- [Mo's algorithm](/content/Extras/Mo's%20algorithm.cpp)



#### Geometry
- [Check If A Point Belong To Line Segment](/content/Geometry/Check%20If%20A%20Point%20Belong%20To%20Line%20Segment.cpp)
- [Check if a point belong to line segment](/content/Geometry/Check%20if%20a%20point%20belong%20to%20line%20segment.cpp)
- [Check if point is inside triangle](/content/Geometry/Check%20if%20point%20is%20inside%20triangle.cpp)
- [Convex Hull](/content/Geometry/Convex%20Hull.cpp)
- [Polygon Lattice Points](/content/Geometry/Polygon%20Lattice%20Points.cpp)
- [Segment Intersection](/content/Geometry/Segment%20Intersection.cpp)
- [Convex hull](/content/Geometry/Convex%20hull.cpp)
- [Polygon lattice points](/content/Geometry/Polygon%20lattice%20points.cpp)
- [Segment intersection](/content/Geometry/Segment%20intersection.cpp)



Expand All @@ -93,9 +91,9 @@
- [Dijkstra (K shortest pahts)](/content/Graphs/Dijkstra%20(K-shortest%20pahts).cpp)
- [Dijkstra](/content/Graphs/Dijkstra.cpp)
- [Extra edges to make directed graph fully connected](/content/Graphs/Extra%20edges%20to%20make%20directed%20graph%20fully%20connected.cpp)
- [Find Bridge Tree components](/content/Graphs/Find%20Bridge-Tree%20components.cpp)
- [Find Bridges](/content/Graphs/Find%20Bridges.cpp)
- [Find articulation points](/content/Graphs/Find%20articulation%20points.cpp)
- [Find bridge tree components](/content/Graphs/Find%20bridge-tree%20components.cpp)
- [Find bridges (online)](/content/Graphs/Find%20bridges%20(online).cpp)
- [Find centroid](/content/Graphs/Find%20centroid.cpp)
- [Floyd Warshall](/content/Graphs/Floyd%20Warshall.cpp)
Expand All @@ -119,17 +117,17 @@

#### Math
- [Arithmetic progression sum](/content/Math/Arithmetic%20progression%20sum.cpp)
- [Binomial Mod](/content/Math/Binomial%20Mod.cpp)
- [Binomial mod](/content/Math/Binomial%20mod.cpp)
- [Binomial](/content/Math/Binomial.cpp)
- [Chinese remainder theorem](/content/Math/Chinese%20remainder%20theorem.cpp)
- [Derangement](/content/Math/Derangement.cpp)
- [Euler phi (in range)](/content/Math/Euler%20phi%20(in%20range).cpp)
- [Euler phi](/content/Math/Euler%20phi.cpp)
- [FFT convolution and exponentiation](/content/Math/FFT%20convolution%20and%20exponentiation.cpp)
- [Factorial Factorization](/content/Math/Factorial%20Factorization.cpp)
- [Factorial factorization](/content/Math/Factorial%20factorization.cpp)
- [Factorization (Pollard's rho)](/content/Math/Factorization%20(Pollard's%20rho).cpp)
- [Factorization](/content/Math/Factorization.cpp)
- [Fast Pow](/content/Math/Fast%20Pow.cpp)
- [Fast pow](/content/Math/Fast%20pow.cpp)
- [Find diophantine equation solution](/content/Math/Find%20diophantine%20equation%20solution.cpp)
- [Find multiplicatinve inverse](/content/Math/Find%20multiplicatinve%20inverse.cpp)
- [GCD](/content/Math/GCD.cpp)
Expand All @@ -138,7 +136,7 @@
- [LCM](/content/Math/LCM.cpp)
- [Linear recurrence](/content/Math/Linear%20recurrence.cpp)
- [List N elements choose K](/content/Math/List%20N%20elements%20choose%20K.cpp)
- [List Primes (Sieve of Eratosthenes)](/content/Math/List%20Primes%20(Sieve%20of%20Eratosthenes).cpp)
- [List primes (Sieve of Eratosthenes)](/content/Math/List%20primes%20(Sieve%20of%20Eratosthenes).cpp)
- [Matrix exponentiation](/content/Math/Matrix%20exponentiation.cpp)
- [NTT convolution and exponentiation (2 mods)](/content/Math/NTT%20convolution%20and%20exponentiation%20(2%20mods).cpp)
- [NTT convolution and exponentiation](/content/Math/NTT%20convolution%20and%20exponentiation.cpp)
Expand All @@ -154,7 +152,7 @@


#### Strings
- [Count Distinct Anagrams](/content/Strings/Count%20Distinct%20Anagrams.cpp)
- [Count distinct anagrams](/content/Strings/Count%20distinct%20anagrams.cpp)
- [Double hash range query](/content/Strings/Double%20hash%20range%20query.cpp)
- [Hash range query](/content/Strings/Hash%20range%20query.cpp)
- [Hash unsigned long long](/content/Strings/Hash%20unsigned%20long%20long.cpp)
Expand All @@ -171,20 +169,19 @@

## References & Courses

- [Thalisson's Library](https://github.com/Thalisson-Alves/Competitive-Programming)
- [Macacário](https://github.com/splucs/Competitive-Programming)
- [KACTL ICPC Code Library](https://github.com/kth-competitive-programming/kactl)
- [PauloMiranda98's Library](https://github.com/PauloMiranda98/Competitive-Programming-Notebook)
- [SSRS lib](https://ssrs-cp.github.io/cp_library/)
- [Thalisson's Library](https://github.com/Thalisson-Alves/Competitive-Programming)
- [IME algoritmos](https://www.ime.usp.br/~pf/algoritmos/idx.html)
- [UFMG Library](https://github.com/brunomaletta/Biblioteca)
- [SSRS lib](https://ssrs-cp.github.io/cp_library/)
- [Macacário](https://github.com/splucs/Competitive-Programming)

- [TEP](https://github.com/edsomjr/TEP)
- [UnBalloon](https://github.com/UnBalloon/programacao-competitiva)
- [Competitive Programmer's Handbook](https://cses.fi/book/book.pdf)
- [Algorithms for Competitive Programming](https://cp-algorithms.com/)
- [Competitive Programing Book](https://cpbook.net/details?cp=4)
- [UnBalloon](https://github.com/UnBalloon/programacao-competitiva)
- [Neps Academy](https://neps.academy/br/courses)
- [USACO Guide](https://usaco.guide/dashboard/)
- [Competitive Programing Book](https://cpbook.net/details?cp=4)
- [Competitive Programmer's Handbook](https://cses.fi/book/book.pdf)

- [TEP](https://github.com/edsomjr/TEP)

0 comments on commit 7db0aa8

Please sign in to comment.