Page Index - YessineJallouli/Competitive-Programming GitHub Wiki

146 page(s) in this GitHub Wiki:

• Home
• Welcome to the Competitive-Programming wiki!
• Tools for contest :
• Number Theory :
• Combinatorics :
• Mathematics :
• Graph Theory :
• Data Structures
• Algorithms :
• Strings :
• Techniques :
• Geometry :
• 0 1 Trie
• Please reload this page
• 2D Segment Tree
• Please reload this page
• 2‐SAT (By Rami)
• Please reload this page
• And Convolution
• Please reload this page
• Best Edu contests
• Please reload this page
• Best Problems
• Please reload this page
• Binomial coefficient O(N) && O(N^2)
• Please reload this page
• Bipartite matching : Hungarian algorithm
• Please reload this page
• Bipartite matching : Kuhn's algorithm
• Please reload this page
• Carmichael Totient
• Please reload this page
• Centroid Decomposition
• Please reload this page
• Chinese Remainder Theorem
• Please reload this page
• Code Jam Hackercup
• Please reload this page
• Convex Hull Trick (CHT)
• Please reload this page
• Dynamic Segment Tree
• Please reload this page
• Euler totient function (phi)
• Please reload this page
• Extended Euclidean Algorithm
• Please reload this page
• Fenwick Tree (BIT)
• Please reload this page
• FFT
• Please reload this page
• FFT with modulo
• Please reload this page
• Gcd Convolution
• Please reload this page
• General Sieve (RAMI)
• Please reload this page
• Geometry Template (By Arpa)
• Please reload this page
• Heavy light decomposition
• Please reload this page
• HLD : Non Commutative Merge
• Please reload this page
• Interpolation
• Please reload this page
• Krushkal's MST (Minimum Spanning Tree)
• Please reload this page
• LCA (Lowest Common Ancestor)
• Please reload this page
• Lcm Convolution
• Please reload this page
• Linear Algebra
• Please reload this page
• Li‐Chao
• Please reload this page
• Lucas's theorem
• Please reload this page
• Matrices
• Please reload this page
• Mo's & Update
• Please reload this page
• Mo's algorithm
• Please reload this page
• Mo's on tree (Query on Path)
• Please reload this page
• Mo's on tree (Query on subtree)
• Please reload this page
• Möbius Function
• Please reload this page
• NTT
• Please reload this page
• Ordered Segment Tree
• Please reload this page
• Ordered Statistic Tree (__gnu_pbds)
• Please reload this page
• Persistent Dynamic Segment Tree
• Please reload this page
• Pollard's rho Factorization
• Please reload this page
• Prefix function. KMP algorithm
• Please reload this page
• Prim's MST (Minimum Spanning Tree)
• Please reload this page
• Rerooting
• Please reload this page
• Segment Tree
• Please reload this page
• Segment Tree Lazy propagation
• Please reload this page
• Shortest path : Bellman Ford
• Please reload this page
• Shortest path : Dijkstra
• Please reload this page
• Shortest path : Floyd Warshall
• Please reload this page
• Sieve of Eratosthenes
• Please reload this page
• Sliding Window Maximum
• Please reload this page
• Sparse Table (RMQ)
• Please reload this page
• Squelette
• Please reload this page
• Stress Test
• Please reload this page
• Strongly Connected Components (SCC)
• Please reload this page
• Suffix array
• Please reload this page
• Testing Tool For GCJ
• Please reload this page
• Topological Sort
• Please reload this page
• Tree Isomorphism
• Please reload this page
• Trie
• Please reload this page
• Union Find
• Please reload this page
• Xor Algebra (Matrix mod 2)
• Please reload this page
• Xor Basis
• Please reload this page
• Xor Convolution
• Please reload this page
• Z function
• Please reload this page