-
-
Notifications
You must be signed in to change notification settings - Fork 1.7k
Translation Progress
Michael Hayter edited this page Oct 20, 2024
·
64 revisions
| Article | Links ru/en | Progress |
|---|---|---|
| Algebra | 22/23 + 4 | |
| Euler's Totient Function | ru src en | ✔️ |
| Number of divisors / sum of divisors | en | 🆕 |
| Euclidean algorithm for finding the GCD (greatest common divisor) | ru src en | ✔️ |
| Sieve of Eratosthenes | ru src en | ✔️ |
| Extended Euclidean Algorithm | ru src en | ✔️ |
| Binary Exponentiation | ru src en | ✔️ |
| Balanced Ternary | ru src en | ✔️ |
| Linear Diophantine Equations | ru src en | ✔️ |
| Linear Congruence Equation | ru src en | ✔️ |
| Modular Inverse | ru src en | ✔️ |
| Chinese Remainder Theorem | ru src en | ✔️ |
| Primitive Root | ru src en | ✔️ |
| Discrete Root | ru src en | ✔️ |
| Discrete Log | ru src en | ✔️ |
| Enumerating submasks of a bitmask | ru src en | ✔️ |
| Gray code | ru src en | ✔️ |
| Sieve of Eratosthenes Having Linear Time Complexity | ru src en | ✔️ |
| Long Arithmetics | ru src en | ✔️ |
| Fibonacci Numbers | ru src en | ✔️ |
| Finding Power of Factorial Divisor | ru src en | ✔️ |
| The factorial N! modulo P in O (P log N) | ru src en | ✔️ |
| Primality tests | en | 🆕 |
| BPSW test on the simplicity of numbers in O (log N) | ru src | ✖️ |
| Factorization algorithms | ru src en | ✔️ |
| Montgomery Multiplication | en | 🆕 |
| Fast Fourier transform | ru src en | ✔️ |
| Operations on polynomials and series | en | 🆕 |
| Data Structures | 7/7 + 3 | |
| Disjoint Set Union | ru src en | ✔️ |
| Fenwick Tree | ru src en | ✔️ |
| Sparse Table | en | 🆕 |
| Segment Tree | ru src en | ✔️ |
| Treap | ru src en | ✔️ |
| Sqrt Decomposition | ru src en | ✔️ |
| Sqrt Tree | en | 🆕 |
| Modification of stack / queue for finding the minimum in O(1) | ru src en | ✔️ |
| Randomized heap | ru src en | ✔️ |
| Delete from data structure | en | 🆕 |
| Dynamic Programming | 2/2 + 3 | |
| Introduction to Dynamic Programming | en | 🆕 |
| Knapsack Problem | en | 🆕 |
| Dynamic Programming on Broken Profile. Problem "Parquet" | ru src en | ✔️ |
| Finding the largest zero submatrix | ru src en | ✔️ |
| Divide and Conquer DP | en | 🆕 |
| String Processing | 11.5/12 | |
| String Hashing | ru src en | ✔️ |
| Rabin-Karp for String Matching | ru src en | ✔️ |
| Expression parsing | ru src en | ✔️ |
| Suffix Array | ru src en | ✔️ |
| Suffix Automaton | ru src en | 〰️ |
| Suffix Tree | ru src en | ✔️ |
| Z-function | ru src en | ✔️ |
| Prefix function | ru src en | ✔️ |
| Finding all sub-palindromes in O(N) | ru src en | ✔️ |
| Lyndon factorization | ru src en | ✔️ |
| Aho-Corasick algorithm | ru src en | ✔️ |
| Finding repetitions | ru src en | ✔️ |
| Linear Algebra | 3/3 + 1 | |
| Gauss & System of Linear Equations | ru src en | ✔️ |
| Gauss & Determinant | ru src en | ✔️ |
| Kraut & Determinant | en | 🆕 |
| Finding rank of a matrix in O (N^3) | ru src en | ✔️ |
| Combinatorics | 9/9 + 1 | |
| The Inclusion-Exclusion Principle | ru src en | ✔️ |
| Binomial Coefficients | ru src en | ✔️ |
| Catalan Numbers | ru src en | ✔️ |
| Necklaces | ru src en | ✔️ |
| The placement of bishops on the chessboard | ru src en | ✔️ |
| Balanced bracket sequences | ru src en | ✔️ |
| Counting labeled graphs | ru src en | ✔️ |
| Generating all K-combinations | ru src en | ✔️ |
| Burnside's lemma / Pólya enumeration theorem | ru src en | ✔️ |
| Stars and bars theorem | en | 🆕 |
| Game Theory | 1.5/2 | |
| Games on arbitrary graphs | ru src en | ✔️ |
| Sprague-Grandy's Theorem. Nim | ru src en | 〰️ |
| Numerical Methods | 3/3 | |
| Integration by Simpson's formula | ru src en | ✔️ |
| Binary Search | ✖️ | |
| Ternary Search | ru src en | ✔️ |
| Newton's method for finding roots | ru src en | ✔️ |
| Geometry | 17/23 + 5 | |
| Basic Geometry | en | 🆕 |
| Length of the union of intervals on a line in O(N log N) | ru src en | ✔️ |
| Oriented area of a triangle and predicate "clockwise" | ru src en | ✔️ |
| Check if two segments intersect | ru src en | ✔️ |
| Finding the equation of the straight line to cut | ru src en | ✔️ |
| Intersection Point of Lines | ru src en | ✔️ |
| Finding Intersection point of Two Segments | ru src en | ✔️ |
| Circle-Line Intersection | ru src en | ✔️ |
| Circle-Circle Intersection | ru src en | ✔️ |
| Pick's Theorem - area of lattice polygons | ru src en | ✔️ |
| Lattice points of non-lattice polygon | en | 🆕 |
| Area of simple polygon | ru src en | ✔️ |
| The task of covering segments by points | ru src | ✖️ |
| The centers of gravity of polygons and polyhedra | ru src | ✖️ |
| Convex Hull construction using Graham's Scan | ru src en | ✔️ |
| Vertical decomposition | ru src en | ✔️ |
| Minkowski sum of convex polygons | en | 🆕 |
| Check points belong to the convex polygon in O (log N) | ru src en | ✔️ |
| Finding the inscribed circle in the convex polygon using ternary search in O (N logTwo C) | ru src | ✖️ |
| Finding the inscribed circle in the convex polygon method of compression of the parties in O (N log N) | ru src | ✖️ |
| Delaunay triangulation and Voronoi diagram | ru src en | ✔️ |
| Finding all faces, the outer face of a planar graph in O (N log N) | ru src | ✖️ |
| Finding the nearest pair of points | ru src en | ✔️ |
| Transforming the geometry of inversion | ru src | ✖️ |
| Finding common tangents to two circles | ru src en | ✔️ |
| Search for a pair of intersecting segments | ru src en | ✔️ |
| Convex hull trick and Li Chao tree | en | 🆕 |
| Point location in O(log n) | en | 🆕 |
| Graphs | 43/51 + 3 | |
| Breadth First Search | ru src en | ✔️ |
| Depth First Search | ru src en | ✔️ |
| Bipartite Graph Check | ru src en | ✔️ |
| 0-1 BFS | en | 🆕 |
| Kirchhoff Theorem | ru src en | ✔️ |
| Topological Sorting | ru src en | ✔️ |
| Finding Bridges in O(N+M) | ru src en | ✔️ |
| Finding Articulation Points in O(N+M) | ru src en | ✔️ |
| Finding Bridges Online | ru src en | ✔️ |
| Checking a graph for acyclicity and finding a cycle in O(M) | ru src en | ✔️ |
| Finding a Negative Cycle in the Graph | ru src en | ✔️ |
| Floyd-Warshall - finding all shortest paths | ru src en | ✔️ |
| Number of paths of fixed length / Shortest paths of fixed length | ru src en | ✔️ |
| Dijkstra - finding shortests paths from given vertex | ru src en | ✔️ |
| Dijkstra on sparse graphs | ru src en | ✔️ |
| Bellman-Ford - finding shortests paths with negative weights | ru src en | ✔️ |
| D´Esopo-Pape algorithm | ru src en | ✔️ |
| Finding Connected Components | ru src en | ✔️ |
| Lowest Common Ancestor | ru src en | ✔️ |
| Lowest Common Ancestor - Binary Lifting | ru src en | ✔️ |
| Lowest Common Ancestor - Farach-Colton and Bender algorithm | ru src en | ✔️ |
| RMQ using LCA | ru src en | ✔️ |
| Lowest Common Ancestor - Tarjan's off-line algorithm | ru src en | ✔️ |
| Minimum Spanning Tree - Prim's algorithm | ru src en | ✔️ |
| Minimum Spanning Tree - Kruskal | ru src en | ✔️ |
| Minimum Spanning Tree - Kruskal with Disjoint Set Union | ru src en | ✔️ |
| Second best MST | en | 🆕 |
| Prüfer Code | ru src en | ✔️ |
| Eulerian path | ru src en | ✔️ |
| Strongly Connected Components and Condensation Graph | ru src en | ✔️ |
| Maximum Flow - Ford-Fulkerson and Edmonds-Karp | ru src en | ✔️ |
| Maximum Flow - Push-relabel method | ru src en | ✔️ |
| Maximum flow - Push-relabel method improved | ru src en | ✔️ |
| Flows with demands | ru src en | ✔️ |
| Minimum-cost flow | ru src en | ✔️ |
| Assignment problem. Solution using min-cost-flow in O (N^5) | ru src en | ✔️ |
| Assignment problem. Hungarian algorithm (Kuhn algorithm) in O (N^3) | ru src en | ✔️ |
| Finding the minimum cut algorithm Curtains-Wagner-O(N^3) | ru src | ✖️ |
| The flow of minimum cost, minimum cost circulation. The algorithm for removing cycles of negative weight | ru src | ✖️ |
| Maximum flow - Dinic's algorithm | ru src en | ✔️ |
| Maximum flow - MPM algorithm | en | 🆕 |
| The Kuhn algorithm of finding a maximum matching in O (N M) | ru src en | ✔️ |
| Finding the highest weight vertex-weighted matching in O (N^3) | ru src | ✖️ |
| Edmonds algorithm finds the maximum matching in arbitrary graphs in O (N^3) | ru src | ✖️ |
| Coating of oriented paths in the acyclic graph | ru src | ✖️ |
| Tutte matrix. A randomized algorithm for finding maximum matching in an arbitrary graph | ru src | ✖️ |
| Edge connectivity | ru src en | ✔️ |
| Vertex connectivity | ru src en | ✔️ |
| Construction of graph with given edge connectivity, vertex connectivity, and minimum degree | ru src en | ✔️ |
| The inverse problem SSSP (inverse-SSSP - inverse shortest paths from one vertex) in O (M) | ru src | ✖️ |
| Inverse MST (inverse-MST - inverse of the minimum core) in O (N M^2) | ru src | ✖️ |
| Tree painting | ru src en | ✔️ |
| 2-SAT | ru src en | ✔️ |
| Heavy-light decomposition | ru src en | ✔️ |
| Sequences | 3/3 | |
| RMQ task (Range Minimum Query - the smallest element in an interval) | ru src en | ✔️ |
| Longest increasing subsequence | ru src en | ✔️ |
| K-th order statistic in O(N) | ru src en | ✔️ |
| Schedules | 3/3 | |
| Scheduling jobs on one machine | ru src en | ✔️ |
| Scheduling jobs on two machines | ru src en | ✔️ |
| The Optimal Schedule Of Jobs Given Their Deadlines And Durations | ru src en | ✔️ |
| Miscellaneous | 4/4 | |
| Joseph's Problem | ru src en | ✔️ |
| 15 Puzzle Game: Existence Of The Solution | ru src en | ✔️ |
| The Stern-Brocot tree and Farey sequences | ru src en | ✔️ |
| Search the subsegment with the maximum/minimum sum | ru src en | ✔️ |