algorithm
Algorithmic Library
File Explorer
Download Latest Version (.zip)- problemset.html
- A.cpp
- B.cpp
- D.cpp
- E.cpp
- F.cpp
- G.cpp
- I.cpp
- K.cpp
- L.cpp
- A.pdf
- B.pdf
- C.pdf
- D.pdf
- E.pdf
- F.pdf
- G.pdf
- H.pdf
- I.pdf
- J.pdf
- K.pdf
- C.cpp
- K.cpp
- A.pdf
- B.pdf
- C.pdf
- D.pdf
- E.pdf
- F.pdf
- G.pdf
- H.pdf
- I.pdf
- J.pdf
- K.pdf
- D.cpp
- E.cpp
- F.cpp
- J.cpp
- A.pdf
- B.pdf
- C.pdf
- D.pdf
- E.pdf
- F.pdf
- G.pdf
- H.pdf
- I.pdf
- J.pdf
- A.cpp
- B.cpp
- C.cpp
- D.cpp
- E.cpp
- F.cpp
- H.cpp
- problemset.html
- A.cpp
- B.cpp
- F.cpp
- G.cpp
- H.cpp
- I.cpp
- J.cpp
- A.pdf
- B.pdf
- C.pdf
- D.pdf
- E.pdf
- F.pdf
- G.pdf
- H.pdf
- I.pdf
- J.pdf
- B.cpp
- C.cpp
- D.cpp
- E.cpp
- H.cpp
- A.pdf
- B.pdf
- C.pdf
- D.pdf
- E.pdf
- F.pdf
- G.pdf
- H.pdf
- I.pdf
- J.pdf
- C.cpp
- H.cpp
- I.cpp
- J.cpp
- A.pdf
- B.pdf
- C.pdf
- D.pdf
- E.pdf
- F.pdf
- G.pdf
- H.pdf
- I.pdf
- J.pdf
- A.cpp
- B.cpp
- C.cpp
- D.cpp
- E.cpp
- F.cpp
- G.cpp
- H.cpp
- I.cpp
- J.cpp
- A.pdf
- B.pdf
- C.pdf
- D.pdf
- E.pdf
- F.pdf
- G.pdf
- H.pdf
- I.pdf
- J.pdf
- A.cpp
- B.cpp
- C.cpp
- D.cpp
- E.cpp
- F.cpp
- G.cpp
- I.cpp
- J.cpp
- Problemset.pdf
- A.cpp
- B.cpp
- C.cpp
- D.cpp
- E.cpp
- F.cpp
- G.cpp
- H.cpp
- I.cpp
- J.cpp
- A.pdf
- B.pdf
- C.pdf
- D.pdf
- E.pdf
- F.pdf
- G.pdf
- H.pdf
- I.pdf
- J.pdf
- A.cpp
- B.cpp
- C.cpp
- D.cpp
- E.cpp
- G.cpp
- H.cpp
- I.cpp
- J.cpp
- A.pdf
- B.pdf
- C.pdf
- D.pdf
- E.pdf
- F.pdf
- G.pdf
- H.pdf
- I.pdf
- J.pdf
- A.cpp
- B.cpp
- C.cpp
- D.cpp
- F.cpp
- G.cpp
- H.cpp
- I.cpp
- J.cpp
- A.pdf
- B.pdf
- C.pdf
- D.pdf
- E.pdf
- F.pdf
- G.pdf
- H.pdf
- I.pdf
- J.pdf
- K.pdf
- D.cpp
- E.cpp
- F.cpp
- G.cpp
- H.cpp
- J.cpp
- A.pdf
- B.pdf
- C.pdf
- D.pdf
- E.pdf
- F.pdf
- G.pdf
- H.pdf
- I.pdf
- J.pdf
- K.pdf
- L.pdf
- A.cpp
- B.cpp
- C.cpp
- D.cpp
- F.cpp
- G.cpp
- H.cpp
- I.cpp
- K.cpp
- L.cpp
- A.pdf
- B.pdf
- C.pdf
- D.pdf
- E.pdf
- F.pdf
- G.pdf
- H.pdf
- I.pdf
- J.pdf
- E.cpp
- I.cpp
- J.cpp
- A.pdf
- B.pdf
- C.pdf
- D.pdf
- E.pdf
- F.pdf
- G.pdf
- H.pdf
- I.pdf
- J.pdf
- D.cpp
- E.cpp
- G.cpp
- H.cpp
- J.cpp
- C724-1006-1.jpg
- C724-1006-2.jpg
- problems.html
- A.cpp
- B.cpp
- C.cpp
- D.cpp
- E.cpp
- G.cpp
- H.cpp
- I.cpp
- J.cpp
- Problemset.pdf
- D.cpp
- H.cpp
- I.cpp
- J.cpp
- A.pdf
- B.pdf
- C.pdf
- D.pdf
- E.pdf
- F.pdf
- G.pdf
- H.pdf
- I.pdf
- J.pdf
- K.pdf
- A.cpp
- H.cpp
- I.cpp
- J.cpp
- K.cpp
- boarding.pdf
- dec.pdf
- rblock.pdf
- boarding.cpp
- dec.cpp
- rblock.cpp
- code.pdf
- fairphoto.pdf
- optics.pdf
- code.cpp
- optics.cpp
- cow.pdf
- grass.pdf
- moovie.pdf
- cow.cpp
- grass.cpp
- moovie.cpp
- boat.pdf
- firework.pdf
- gap.pdf
- boat.cpp
- AhoCorasick 2.cpp
- EdmondsLawler 2.cpp
- HashModule.cpp
- HeavyLightDecomposition 2.cpp
- LinearPrograming 2.cpp
- LinkcutTree 2.cpp
- ManhattanMST 2.cpp
- NTT 2.cpp
- PersistentTreap 2.cpp
- Pollard 2.cpp
- QuadTree.cpp
- SmallestEnclosingCircle 2.cpp
- SplayTree 2.cpp
- SplayTree 3.cpp
- Splaytree.cpp
- Treap 2.cpp
- D.cpp
- C.cpp
- 3DGeometry.cpp
- AntiPodalPair.cpp
- AreaCircleUnion O(N^2logN).cpp
- AreaCircleUnion O(N^3logN).cpp
- AreaIntersectionTriangleCircle.cpp
- ClosestPair.cpp
- Common2D.cpp
- ConvexHull.cpp
- DynamicConvexHull (Insert Only).cpp
- DynamicConvexHull.cpp
- FarthestBetweenTwoSetPoints.cpp
- FarthestPair.cpp
- Geometry.cpp
- HalfPlaneIntersect.cpp
- ManhattanMST.cpp
- SmallestEnclosingCircle.cpp
- BitSet.cpp
- CascadingSegment.cpp
- CenTroidTree.cpp
- DominatorTree.cpp
- DynamicLineHull.cpp
- FastSegmentTree.cpp
- Fenwick1D RangeUpdate.cpp
- Fenwick2D RangeUpdate.cpp
- FiniteField.cpp
- HashTable.cpp
- KDTree.cpp
- LineHull.cpp
- LinkcutTree.cpp
- MagicTree.cpp
- OrderedTree.cpp
- PersistentMagicTree.cpp
- PersistentSegmentTree.cpp
- PersistentTreap.cpp
- PolicyTree.cpp
- RadixSort.cpp
- RangeQuery O(1, sqrt(n)).cpp
- RectangleUnion.cpp
- RegionTree.cpp
- RMQ.cpp
- RMQ2D.cpp
- SegmentTree.cpp
- SegmentTree2D.cpp
- SplayTree.cpp
- Treap.cpp
- 1D1D.cpp
- ConvexHull.cpp
- DivideConquer.cpp
- DivideFFT.cpp
- Knuth.cpp
- Fibonacci mod 10^9 + 9.txt
- Newton's identity.bmp
- Phi sum.jpg
- Arborescence.cpp
- Arborescence_NonTrace_LowMem.cpp
- Biconnected.cpp
- Blossom.cpp
- DemandFlow.cpp
- Euler.cpp
- HeavyLightDecomposition.cpp
- HopcroftKarp.cpp
- Hungary.cpp
- LCA - O(NlogN, 1).cpp
- MaxCostMatching.cpp
- Maxflow.cpp
- MincostMaxflow(SPFA).cpp
- MincostMaxflow.cpp
- Mo'sTree.cpp
- SmallToLargeOnTree.cpp
- StableMarriage.cpp
- StoerWagner.cpp
- TreeCentroidDecomposition.cpp
- Twosat.cpp
- BigDecimal sqrt.java
- BigInteger nthroot.java
- BitSet Shift.java
- ChineseRemainderTheorem.java
- Dinic.java
- DynamicConvexHull.java
- Matrix.java
- ModularDeterminant.java
- Template.java
- Bignum - Simple.cpp
- Bignum.cpp
- BinaryMatrix.cpp
- BitwiseFFT.cpp
- BM.cpp
- ChineseRemainder.cpp
- Counting ax + by + c = 0.cpp
- FastRecurrence.cpp
- FermatRepresent.cpp
- FFT.cpp
- GaussTrick.cpp
- Interpolation.cpp
- Inverse.cpp
- Karatsuba.cpp
- Lehmer's Method.cpp
- Matrix.cpp
- MatrixInverse.cpp
- Mod64.cpp
- NTT.cpp
- NTT_LowMem.cpp
- Pollard.cpp
- Polynomial.cpp
- PrefixMulticativeFunction.cpp
- PrimitiveRoot.cpp
- QuadraticResidue.cpp
- Rabin.cpp
- Recurrence.cpp
- Sieve.cpp
- Simplex.cpp
- Date.cpp
- GridModule.cpp
- SMAWK Algorithm.cpp
- Linear Programming.pdf
- Polynomial Algorithms.pdf
- Valleyless Sequences.pdf
- A simple O(nlogn) algorithm for finding maximum distance between two finite planar sets.pdf
- Dynamic Convexhull 1.pdf
- Dynamic Convexhull 2.pdf
- Metric Spaces.pdf
- MinimumAreaRectangle.pdf
- Optimal Algorithms for Computing the Minimum Distance.pdf
- ShamosThesis.pdf
- Smallest enclosing circles and more.pdf
- Solving Geometric Problems with the Rotating Calipers.pdf
- Static Dynamic Convexhull.pdf
- Voronoi diagrams and Delaunay triangulations 1.pdf
- Voronoi diagrams and Delaunay triangulations 2.pdf
- 2D Range Query.pdf
- A Subquadratic Algorithm for Minimum Palindromic Factorization.pdf
- Dominator.pdf
- Eertree An Efficient Data Structure for Processing Palindromes in Strings.pdf
- KDTree.pdf
- Persistent Data Structures.pdf
- SkipList.pdf
- Suffix Array.pdf
- The SMAWK algorithm.pdf
- Varn codes and generalized fibonacci trees.pdf
- Dynamic Programming - Quadrangle Inequalities.pdf
- Dynamic programming optimization.pdf
- Dynamic programming with convexity, concavity and sparsity.PDF
- Dynamic Programming.pdf
- GENERATION OF TESTS AGAINST A GREEDY ALGORITHM FOR THE KNAPSACK PROBLEM USING AN EVOLUTIONARY ALGORITHM.pdf
- Efficient Algorithms for the Problems of Enumerating.pdf
- Extensions of Maximum Flow.pdf
- Max-Flow Extensions.pdf
- Minimum cost maximum flow - Minimum cost circulation.pdf
- Network Flow III Applications.pdf
- Counting given length cycles.pdf
- Maximum matching.pdf
- Nim.pdf
- Cantor-Zassenhaus Algorithm.pdf
- Computing Order Statistics in the Farey.pdf
- Computing pi(n).pdf
- Cornacchiaβs Algorithm.pdf
- Distinct Degree Factoring.pdf
- GaussianNumber.pdf
- Narayana Number.pdf
- Increasing sequence.pdf
- Lattice walks.pdf
- Maximum Density Segment.pdf
- Two-pan balance.pdf
- AhoCorasick.cpp
- KMP.cpp
- LyndonFactorization.cpp
- Manacher.cpp
- MinimalRotation.cpp
- PalindromicTree.cpp
- SuffixArray DC3 O(N).cpp
- SuffixArray.cpp
- SuffixAutomaton.cpp
- Ukkonenβs SuffixTree.cpp
- Zfunction.cpp
- README.md
- Sol PE.txt
// repository documentation
Was this content helpful?
(0 ratings)