C++ algorithms and data structures used by UFPB teams in ICPC contests.
📄 Printable Reference (PDF) · LaTeX source · Contest template
This repository contains a curated collection of algorithms and data structures optimized for competitive programming.
It serves as the official reference library for teams representing the Federal University of Paraíba (UFPB).
The primary goal is to provide C++ implementations that are high-performance, robust, and easy to integrate under the time constraints of a live contest.
- 2D Prefix Sum
- BIT (Fenwick Tree)
- Difference Array
- Disjoint Set Union (DSU)
- Indexed Set
- Kadane's Algorithm
- Minimum Queue
- Segment Tree
- Sparse Table
- Subarrays
- Edit Distance
- Knapsack
- Longest Common Subsequence (LCS)
- Longest Increasing Subsequence (LIS)
- Subset Sum
- Bellman-Ford
- Bipartite Check
- Breadth-First Search (BFS)
- Cycle Detection
- Dijkstra
- Floyd-Warshall
- Kruskal
- Big Integer (BigInt)
- Binary Exponentiation
- Euler's Totient Function
- Extended Euclid
- GCD and LCM
- Horner's Method
- Modular Inverse
- Sieve of Eratosthenes
- Wheel Factorization
- 8 Queens Puzzle
- Coordinate Compression
- Distances
- Gambler's Ruin
- Perfect Square
- Rectangle Intersection
- Rotate Matrix
- String Permutation
- cp-algorithms
- Bruno Maletta's Algorithm Library
- Errichto Contest Library
- ShahjalalShohag Code Library
Made by team pacode @ UFPB · Licensed under the MIT License