icpc-notebook

Link da Planilha

https://docs.google.com/spreadsheets/d/1Y-_G2ioJ_iheDGKVHrQQu96keee66Y4s6SRxUTsDnGs/edit#gid=0

Table of Contents

DataStructures

• BIT.cpp
• BIT2D.cpp
• CartesianTree.cpp
• DSUPartial.cpp
• SparseTable.cpp
• SegTree.cpp
• SegTreePersistent.cpp
• SegTree2D.cpp
• SegTreeLazy.cpp
• SegTreeBeats.cpp
• SegTreeSparse.cpp
• ImplicitSet.cpp
• MergeSortTree.cpp
• MinQueue.cpp
• Treap.cpp
• TreapPersistent.cpp
• RandomizedHeap.cpp
• WaveletTree.cpp
• WaveletTreeToggle.cpp
• SplayTree.cpp
• KDTree.cpp
• LichaoTree.cpp
• Paretto.cpp
• TwoPointers.cpp

DP

• DivideAndConquer.cpp
• CHT.cpp
• Aliens.cpp
• Knuth.cpp
• 1D1D.cpp
• Slope.cpp @ https://codeforces.com/blog/entry/47821
• SOS.cpp
• KnapsackBounded.cpp

Geometry

• Point.cpp
• PointUtils.cpp
• Point3D.cpp
• Circle.cpp
• Triangle.cpp
• ConvexHull.cpp
• RotatingCalipers.cpp
• Pick.cpp
• HalfPlanesIntersection.cpp
• Minkowski.cpp
• DelaunayTriangulation.cpp
• Shoelace.cpp
• StableSum.cpp

Graphs

• Kruskal.cpp
• BellmanFord.cpp
• Dinic.cpp
• DirectedMST.cpp
• EdmondsKarp.cpp
• Hungarian.cpp
• MCMF.cpp
• Kuhn.cpp
• TwoSat.cpp
• Kosaraju.cpp
• EdmondsMDST.cpp
• DominatorTree.cpp
• TarjanSCC.cpp
• TarjanBridges.cpp
• Prim.cpp
• DynamicConnectivity.cpp
• NegativeCycles.cpp
• BlockCut.cpp
• BiconnectedComponents.cpp
• EulerCycle.cpp
• MCMF.cpp
• /CycleSimulation
  • full.cpp
  • simple.cpp
  • tortoise_hare.cpp

Tree

• EulerTour.cpp
• Centroid.cpp
• CentroidQuery.cpp
• HeavyLight.cpp
• LCA.cpp
• LinkCutTree.cpp
• SmallToLarge.cpp
• Isomorphism.cpp

Math

• Karatsuba.cpp
• EuclideanGCD.cpp
• MillerRabin.cpp
• PollardRho.cpp
• PollardRhoFast.cpp
• Montgomery64.cpp
• Montgomery128.cpp
• Diophantine.cpp
• ChineseRemainder.cpp
• ModMul.cpp
• FFT.cpp
• NTT.cpp
• DiscreteLog.cpp
• PrimitiveRoot.cpp
• Mobius.cpp
• EulerPhi.cpp
• Sieve.cpp
• LinearSieve.cpp
• SegmentedSieve.cpp
• Stirling.cpp
• LucasTheorem.cpp
• GaussianElimination.cpp
• MatrixExponentiation.cpp
• PowerTower.cpp
• Simplex.cpp
• PointsUnderLine.cpp
• BerlekampMassey.cpp
• LagrangeInterpolation.cpp
• MultiPointEvalutation.cpp
• Combinatorics.cpp
• Integrate.cpp @ https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4146
• Polynomial.cpp
• Partition.cpp
• FWHT.cpp https://csacademy.com/blog/fast-fourier-transform-and-variations-of-it
• Probability.cpp
• MarkovChains.cpp

Strings

• AhoCorasick.cpp
• PalindromicTree.cpp
• Trie.cpp
• Hash.cpp
• SuffixTree.cpp
• SuffixArray.cpp
• SuffixAutomaton.cpp
• KMPAutomata.cpp
• KMP.cpp
• Z.cpp
• Manacher.cpp
• LyndonFactorization.cpp
• Booths.cpp

Misc

• OrderedSet.cpp + OrdMultiset e avisos
• Rope.cpp
• Date.cpp @ https://github.com/IMEplusplus/icpc-notebook/tree/master/misc
• CoordinateCompressor.cpp
• Pragma.cpp
• FastIO.cpp
• InputReader.java
• OutputWriter.java
• Main.java

Solutions

• /Geometry
  • NearestTwoPoints.cpp
  • FarthestTwoPoints.cpp
  • SmallestEnclosingCircle.cpp
• /Math
  • GrayCode.cpp
  • BurnsideLemma.cpp
  • AndConvolution.cpp
• /DP
  • MaximumClique.cpp
  • CycleCount.cpp
  • PermutationTransformTrick.cpp
  • ConnectedComponent.cpp
• /Graph
  • DagWidth.cpp
• /Greedy
  • StableMarriage.cpp
• /Strings
  • LCS.cpp
  • Periods.cpp
  • Rotation.cpp
  • Palindrome.cpp
  • StringDivisors.cpp
  • CommonDivisors.cpp
  • MinimalRotation.cpp
• /DataStructures
  • Mo.cpp
• /SegmentTree
  • sorting.cpp