Competitive Programming

My competitive programming repo, with resources and codes that I like it ❤️

What is competitive programming? 🤔

I like these videos to introduce competitive programming to a new person:

• What is Competitive Programming? (Willian Lin)
• How to start Competitive Programming? For beginners! (Errichto)

Sites to study/train 🚀

• Codeforces
• Atcoder
• SPOJ
• Uri Online Judge
• E-Maxx Algorithms in English
• The Ultimate Topic List (Codeforces)

And many others, sky is the limit :)

Utils 📓

• Trello Board
• Stanford ACM repo (To create library PDF for competitions)

Topics 📚

• Binary Search and Ternary Search 😄

  • Aplications and examples
  • Parallel Binary Search

• Dynamic Programming ❤️

  • Digit DP
  • Knapsack
  • Broken Profile DP
  • Divide and conquer DP
  • Expected Value
  • Suffix sum - Recursive DP
  • Kadane and Circular Kadane
  • Largest square of 1’s
  • Longest common subsequence
  • Longest increasing subsequence
  • Matrix path with maximum sum
  • Count substring ocurrences
  • Tip DP
  • SOS DP
  • Aliens Trick
  • Convex Hull Trick
  • Dynamic Convex Hull Trick
  • Li-Chao Tree
  • Exchange Arguments
  • Bitwise DIgit DP
  • Subset Sum
  • Steiner Tree
  • Inclusion Exclusion
  • Permutation Counting
  • Optimization with FFT

• Geometry 😠

  • Basic Template
  • Line Sweep
  • Minkowski sum
  • Convex Hull
  • Smallest Enclosing Circle
  • KDTree
  • Half-plane intersection
  • Dynamic Convex Hull
  • Polygons Distance
  • Point Location Query on convex hull
  • Polygon Isomorfism
  • Lines comparison

• Graphs ❤️

  • BFS
  • DFS
  • Dijkstra
  • Floyd Warshall
  • Bipartite Check
  • Bipartite DSU
  • Number of Connected Components on Segments
  • Kruskal
  • Prim
  • Topological Sort
  • DSU
  • DSU with rollback
  • Eulerian Path
  • Cycle Detection
  • Find Bridges
  • Find Articulation Points
  • SCCs & Condensation Graph
  • 2-SAT
  • Strong Orientation
  • Block Cut Tree
  • Stable Matching
  • Erdos Gallai
  • Dominator Tree
  • Notes
  • Segtree Graph

• Trees ❤️

  • Lowest Common Ancestor
  • RMQ on tree using LCA
  • Diameter of a tree
  • Euler Tour
  • Reroot
  • Centroid Decomposition
  • HLD (Vertex cost)
  • HLD (Edge cost)
  • Mo's Algorithm on Trees
  • Mo's Algorithm on Trees (Edge cost)
  • Tree Isomorfism
  • Sack (dsu on tree)
  • Link Cut Tree (Edge cost)
  • Link Cut Tree (Vertex cost)
  • Virtual Tree

• Flows and Matchings ❤️

  • Ford Fulkerson
  • Dinic
  • MinCostFlow
  • Hopcroft-Karp-Karzanov
  • Hungarian
  • Maximum flow problem with minimum capacities
  • Hall theorem
  • Push Relabel
  • Maximum bipartite matching after remove one vertex
  • Kuhn

• Math 😠

  • Modular Operations Template
  • Fractions Template
  • Prime Factorization
  • Sieve
  • Segmented Sieve
  • Chinese Remainder Theorem
  • Diophantine Equations
  • FFT
  • NTT
  • Gaussian Elimination
  • Gaussian Elimination mod 2
  • Matrix Exponentiation
  • Pollard Rho
  • Lagrange Interpolation
  • Xor Trie
  • Mobius Inversion
  • Euler Totient Function
  • Stars and Bars
  • Maximum Xor Subsequence
  • FWHT
  • Berlekamp Massey
  • Simplex
  • Chicken Mcnugget Theorem
  • Catalan Numbers
  • Matrix inverse and matrix determinant
  • CRT trick
  • Markov chain

• Strings 😄

  • Aho Corasick
  • Suffix Automaton
  • Suffix Array
  • String Hashing (mod 2ˆ61 - 1)
  • String Hashing (recent template)
  • KMP
  • Z-function
  • Rabin Karp
  • Manacher
  • String Matching (FFT)
  • De Bruijin sequence

• Data Structures ❤️

  • Segtree
  • Lower Bound on segtree
  • Segtree 2D
  • Iterative Segtree
  • Implicit Segtree
  • Segtree with Lazy Propagation
  • Arithmetic Progression Segtree
  • Segment with Maximum/Minimum sum Segtree
  • Fenwick Tree
  • Fenwick Tree with Range Update
  • Fenwick Tree 2D
  • Fenwick Tree 2D (with cordinate compression)
  • Merge Sort Tree
  • Merge Sort Tree (BIT)
  • Min Queue
  • Persistent Segtree
  • Sparse Table
  • Sparse Table (Binary Lifting)
  • Mo's algorithm
  • Mo's algorithm with Update
  • Treap
  • Color Update
  • RMQ

• Miscellaneous 😄

  • Inversion Count
  • Stack Trick
  • Two Pointers
  • Examples of bitmasks problems
  • Meet in the middle
  • Sprague-Grundy
  • Coordinate Compression
  • Tower of Hanoi
  • Segment Covering
  • 2D Prefix Sum
  • Sum hash
  • Rectangle Union Area
  • Max Plus Convolution
  • Bellman ford to solve linear programming problem

Competitions solutions ✅

• SBC Brazilian Phase Zero 2025
  • All problems solved
• The 2025 ICPC Latin America Championship
  • All problems solved, except problems E and J
• 2024-2025 ACM-ICPC Brazil Subregional Programming Contest
  • All problems solved
• 2024-2025 ACM-ICPC Latin American Regional Programming Contest
  • All problems solved, except problem C
• The 2024 ICPC Latin America Championship
  • All problems solved, except problems B and I
• 2023-2024 ACM-ICPC Brazil Subregional Programming Contest
  • All problems solved, except problem J
• 2023-2024 ACM-ICPC Latin American Regional Programming Contest
  • All problems solved, except problems A and E
• 2022-2023 ACM-ICPC Brazil Subregional Programming Contest
  • All problems solved
• 2022-2023 ACM-ICPC Latin American Regional Programming Contest
  • All problems solved, except problems G and J
• 2021-2022 ACM-ICPC Brazil Subregional Programming Contest
  • All problems solved
• 2021-2022 ACM-ICPC Latin American Regional Programming Contest
  • Solved B, C, F, G, H, J, K, L and M
• 2020-2021 ACM-ICPC Brazil Subregional Programming Contest
  • All problems solved, except problem J
• 2020-2021 ACM-ICPC Latin American Regional Programming Contest
  • All problems solved, except problem I
• 2019-2020 ACM-ICPC Brazil Subregional Programming Contest
  • All problems solved, except problems C and E
• 2019-2020 ACM-ICPC Latin American Regional Programming Contest
  • Solved C, D, E, F, G, I, J, K, L, M
• 2018-2019 ACM-ICPC Brazil Subregional Programming Contest
  • All problems solved, except problems A, H, K and M
• 2018-2019 ACM-ICPC Latin American Regional Programming Contest
  • Solved A, B, C, D, F, H, I, L, and M
• 2017-2018 ACM-ICPC Brazil Subregional Programming Contest
  • Solved A, C, D, E, F, G, I, J, M and L
• 2017-2018 ACM-ICPC Latin American Regional Programming Contest
  • All problems solved, except problems A, K and L
• 2013-2014 ACM-ICPC Brazil Subregional Programming Contest
  • All problems solved
• 2023 Argentinian Programming Tournament (TAP)
  • All problems solved
• UFPE Starters Final Try-Outs 2020
  • All problems solved
• UFPE Starters Final Try-Outs 2021
  • Solved B, C, D, E, F

Some of my accounts on websites 💻

• Codeforces (Ayalla)
• Atcoder (Ayallaa)

Made with ❤️