Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Translation Progress

Michael Hayter edited this pageApr 11, 2025 ·68 revisions

Translation Progress (129 / 145 + 21)

ArticleLinks ru/enProgress
Algebra22/23 + 4
Euler's Totient Functionrusrcen✔️
Number of divisors / sum of divisorsen🆕
Euclidean algorithm for finding the GCD (greatest common divisor)rusrcen✔️
Sieve of Eratosthenesrusrcen✔️
Extended Euclidean Algorithmrusrcen✔️
Binary Exponentiationrusrcen✔️
Balanced Ternaryrusrcen✔️
Linear Diophantine Equationsrusrcen✔️
Linear Congruence Equationrusrcen✔️
Modular Inverserusrcen✔️
Chinese Remainder Theoremrusrcen✔️
Primitive Rootrusrcen✔️
Discrete Rootrusrcen✔️
Discrete Logrusrcen✔️
Enumerating submasks of a bitmaskrusrcen✔️
Gray coderusrcen✔️
Sieve of Eratosthenes Having Linear Time Complexityrusrcen✔️
Long Arithmeticsrusrcen✔️
Fibonacci Numbersrusrcen✔️
Finding Power of Factorial Divisorrusrcen✔️
The factorial N! modulo P in O (P log N)rusrcen✔️
Primality testsen🆕
BPSW test on the simplicity of numbers in O (log N)rusrc✖️
Factorization algorithmsrusrcen✔️
Montgomery Multiplicationen🆕
Fast Fourier transformrusrcen✔️
Operations on polynomials and seriesen🆕
Data Structures7/7 + 3
Disjoint Set Unionrusrcen✔️
Fenwick Treerusrcen✔️
Sparse Tableen🆕
Segment Treerusrcen✔️
Treaprusrcen✔️
Sqrt Decompositionrusrcen✔️
Sqrt Treeen🆕
Modification of stack / queue for finding the minimum in O(1)rusrcen✔️
Randomized heaprusrcen✔️
Delete from data structureen🆕
Dynamic Programming2/2 + 3
Introduction to Dynamic Programmingen🆕
Knapsack Problemen🆕
Dynamic Programming on Broken Profile. Problem "Parquet"rusrcen✔️
Finding the largest zero submatrixrusrcen✔️
Divide and Conquer DPen🆕
String Processing12/12
String Hashingrusrcen✔️
Rabin-Karp for String Matchingrusrcen✔️
Expression parsingrusrcen✔️
Suffix Arrayrusrcen✔️
Suffix Automatonrusrcen✔️
Suffix Treerusrcen✔️
Z-functionrusrcen✔️
Prefix functionrusrcen✔️
Finding all sub-palindromes in O(N)rusrcen✔️
Lyndon factorizationrusrcen✔️
Aho-Corasick algorithmrusrcen✔️
Finding repetitionsrusrcen✔️
Linear Algebra3/3 + 1
Gauss & System of Linear Equationsrusrcen✔️
Gauss & Determinantrusrcen✔️
Kraut & Determinanten🆕
Finding rank of a matrix in O (N^3)rusrcen✔️
Combinatorics9/9 + 1
The Inclusion-Exclusion Principlerusrcen✔️
Binomial Coefficientsrusrcen✔️
Catalan Numbersrusrcen✔️
Necklacesrusrcen✔️
The placement of bishops on the chessboardrusrcen✔️
Balanced bracket sequencesrusrcen✔️
Counting labeled graphsrusrcen✔️
Generating all K-combinationsrusrcen✔️
Burnside's lemma / Pólya enumeration theoremrusrcen✔️
Stars and bars theoremen🆕
Game Theory1.5/2
Games on arbitrary graphsrusrcen✔️
Sprague-Grandy's Theorem. Nimrusrcen〰️
Numerical Methods3/3 + 1
Integration by Simpson's formularusrcen✔️
Binary Search🆕
Ternary Searchrusrcen✔️
Newton's method for finding rootsrusrcen✔️
Geometry17/23 + 5
Basic Geometryen🆕
Length of the union of intervals on a line in O(N log N)rusrcen✔️
Oriented area of a triangle and predicate "clockwise"rusrcen✔️
Check if two segments intersectrusrcen✔️
Finding the equation of the straight line to cutrusrcen✔️
Intersection Point of Linesrusrcen✔️
Finding Intersection point of Two Segmentsrusrcen✔️
Circle-Line Intersectionrusrcen✔️
Circle-Circle Intersectionrusrcen✔️
Pick's Theorem - area of lattice polygonsrusrcen✔️
Lattice points of non-lattice polygonen🆕
Area of simple polygonrusrcen✔️
The task of covering segments by pointsrusrc✖️
The centers of gravity of polygons and polyhedrarusrc✖️
Convex Hull construction using Graham's Scanrusrcen✔️
Vertical decompositionrusrcen✔️
Minkowski sum of convex polygonsen🆕
Check points belong to the convex polygon in O (log N)rusrcen✔️
Finding the inscribed circle in the convex polygon using ternary search in O (N logTwo C)rusrc✖️
Finding the inscribed circle in the convex polygon method of compression of the parties in O (N log N)rusrc✖️
Delaunay triangulation and Voronoi diagramrusrcen✔️
Finding all faces, the outer face of a planar graph in O (N log N)rusrc✖️
Finding the nearest pair of pointsrusrcen✔️
Transforming the geometry of inversionrusrc✖️
Finding common tangents to two circlesrusrcen✔️
Search for a pair of intersecting segmentsrusrcen✔️
Convex hull trick and Li Chao treeen🆕
Point location in O(log n)en🆕
Graphs43/51 + 3
Breadth First Searchrusrcen✔️
Depth First Searchrusrcen✔️
Bipartite Graph Checkrusrcen✔️
0-1 BFSen🆕
Kirchhoff Theoremrusrcen✔️
Topological Sortingrusrcen✔️
Finding Bridges in O(N+M)rusrcen✔️
Finding Articulation Points in O(N+M)rusrcen✔️
Finding Bridges Onlinerusrcen✔️
Checking a graph for acyclicity and finding a cycle in O(M)rusrcen✔️
Finding a Negative Cycle in the Graphrusrcen✔️
Floyd-Warshall - finding all shortest pathsrusrcen✔️
Number of paths of fixed length / Shortest paths of fixed lengthrusrcen✔️
Dijkstra - finding shortests paths from given vertexrusrcen✔️
Dijkstra on sparse graphsrusrcen✔️
Bellman-Ford - finding shortests paths with negative weightsrusrcen✔️
D´Esopo-Pape algorithmrusrcen✔️
Finding Connected Componentsrusrcen✔️
Lowest Common Ancestorrusrcen✔️
Lowest Common Ancestor - Binary Liftingrusrcen✔️
Lowest Common Ancestor - Farach-Colton and Bender algorithmrusrcen✔️
RMQ using LCArusrcen✔️
Lowest Common Ancestor - Tarjan's off-line algorithmrusrcen✔️
Minimum Spanning Tree - Prim's algorithmrusrcen✔️
Minimum Spanning Tree - Kruskalrusrcen✔️
Minimum Spanning Tree - Kruskal with Disjoint Set Unionrusrcen✔️
Second best MSTen🆕
Prüfer Coderusrcen✔️
Eulerian pathrusrcen✔️
Strongly Connected Components and Condensation Graphrusrcen✔️
Maximum Flow - Ford-Fulkerson and Edmonds-Karprusrcen✔️
Maximum Flow - Push-relabel methodrusrcen✔️
Maximum flow - Push-relabel method improvedrusrcen✔️
Flows with demandsrusrcen✔️
Minimum-cost flowrusrcen✔️
Assignment problem. Solution using min-cost-flow in O (N^5)rusrcen✔️
Assignment problem. Hungarian algorithm (Kuhn algorithm) in O (N^3)rusrcen✔️
Finding the minimum cut algorithm Curtains-Wagner-O(N^3)rusrc✖️
The flow of minimum cost, minimum cost circulation. The algorithm for removing cycles of negative weightrusrc✖️
Maximum flow - Dinic's algorithmrusrcen✔️
Maximum flow - MPM algorithmen🆕
The Kuhn algorithm of finding a maximum matching in O (N M)rusrcen✔️
Finding the highest weight vertex-weighted matching in O (N^3)rusrc✖️
Edmonds algorithm finds the maximum matching in arbitrary graphs in O (N^3)rusrc✖️
Coating of oriented paths in the acyclic graphrusrc✖️
Tutte matrix. A randomized algorithm for finding maximum matching in an arbitrary graphrusrc✖️
Edge connectivityrusrcen✔️
Vertex connectivityrusrcen✔️
Construction of graph with given edge connectivity, vertex connectivity, and minimum degreerusrcen✔️
The inverse problem SSSP (inverse-SSSP - inverse shortest paths from one vertex) in O (M)rusrc✖️
Inverse MST (inverse-MST - inverse of the minimum core) in O (N M^2)rusrc✖️
Tree paintingrusrcen✔️
2-SATrusrcen✔️
Heavy-light decompositionrusrcen✔️
Sequences3/3
RMQ task (Range Minimum Query - the smallest element in an interval)rusrcen✔️
Longest increasing subsequencerusrcen✔️
K-th order statistic in O(N)rusrcen✔️
Schedules3/3
Scheduling jobs on one machinerusrcen✔️
Scheduling jobs on two machinesrusrcen✔️
The Optimal Schedule Of Jobs Given Their Deadlines And Durationsrusrcen✔️
Miscellaneous4/4
Joseph's Problemrusrcen✔️
15 Puzzle Game: Existence Of The Solutionrusrcen✔️
The Stern-Brocot tree and Farey sequencesrusrcen✔️
Search the subsegment with the maximum/minimum sumrusrcen✔️
Clone this wiki locally
[8]ページ先頭
©2009-2025 Movatter.jp