Nguyễn Bỉnh Khiêm · ITK24
BF Training ITK24 NBK
Lộ trình 77 buổi luyện thi lập trình thi đấu — dữ liệu lấy trực tiếp từ README của repo, đánh dấu tiến độ được lưu ngay trên trình duyệt của bạn.
Tiến độ tổng
0/365 bài đã giải · 77 buổi học
0% hoàn thànhChưa làm: 365Đang làm: 0Đã giải: 0Bỏ qua: 0
- Setup Environment
- Debugging
- Complexity
- Brute-force
- Recursion & Backtracking
- Branch-N-Bound
- Greedy
VNOJ
- Two Pointers
VNOJLQDOJ
- Ternary Search
VNOJCodeforcesLQDOJKattis
- Bitmask
- Meet-in-the-middle
SPOJVNOJ
- Prefix Sum 2D
LuoguVNOJ
- Fermat's Little Theorem
- Binary Exponentiation
- Modular Inverse
- Arithmetic Progression and Geometric Progression
CodeforcesCSES
- Sieve of Eratosthenes
- Prime Factorization in O(log)
- Some Useful Number Theoretic Functions
VNOJLQDOJ
- Euler's Totient Function
- Primality Tests
- Randomized Algorithms (Probabilities)
CodeforcesHackerRankVNOJ
Codeforces
VNOJ
- Tracing
- Some Basic Techniques: Memory Optimization, Swap Labels
VNOJAtCoderCSES
VNOJ
- Linked List
- Stack
VNOJHackerRankCodeforces
- Deque
VNOJ
- Some Useful Built-in Data Structures in C++
VNOJCodeforces
- Difference Array
VNOJCodeforcesCSES
- Merge Sort Tree
VNOJ
- Segment Tree combined with other Data Structures
- Segment Tree 2D and Fenwick Tree 2D
VNOJ
CodeforcesVNOJ
- Graph Traversal: Breadth First Search (BFS)
VNOJCodeforces
CodeforcesVNOJ
- Advanced DFS: Assign Colors (to Detect Cycles and Bipartite Graph) and Compute the Entry & Exit Times
VNOJCodeforces
VNOJCodeforces
VNOJCodeforces
HackerRankVNOJ
- Lowest Common Ancestor (LCA)
CodeforcesVNOJ
VNOJCodeforces
- Mo's Algorithm
CodeforcesLQDOJ
- Centroid Decomposition
CodeforcesCSES
VNOJCSES
- Single-source Shortest Paths: Dijkstra's Algorithm
- All-pair Shortest Paths: Floyd-Warshall Algorithm
VNOJ
VNOJ
LQDOJCodeforces
VNOJCodeforces
VNOJCodeforces
VNOJCodeforces
VNOJCodeforces
VNOJ
CodeforcesLQDOJ
VNOJ
VNOJCodeforces
VNOJ
- Sum over Subsets (SOS) DP
VNOJCodeforces
VNOJCodeforces
LQDOJVNOJCodeforcesCSES
- Prefix Function - KMP Algorithm
- Z-Function - Z Algorithm
- Manacher Algorithm
- Trie
VNOJCodeforces
VNOJLQDOJCodeforces
Codeforces
CodeforcesUSACOAtCoder
- Eulerian Tour on Tree
- Small-to-Large Merging
CSESVNOJCodeforces
- Convex Hull Trick
- Li Chao Tree
K23OJ
K23OJ
K23OJ
K23OJ
K23OJ
- Finding Negative Cycles
- Functional Graphs (Successor Graphs)
CSESCodeforces
- Nim Game
- Sprague-Grundy Theorem
CSESCodeforces
CSES
- Counting Configurations by Prefix
- Finding the K-th Configuration and the Rank of a Configuration
VNOJCodeforcesAtCoder
- Linearity of Expectation
- Expected Value DP
CSESAtCoderCodeforces
- DSU with Parity (Bipartiteness Checking)
AtCoderCodeforcesLuogu
- Area of Union of Rectangles
- Counting Points in Rectangles (Offline)
CSESVNOJCodeforces
- Bitset Optimization
CodeforcesCSES
- Virtual Tree (Auxiliary Tree)
- Kruskal Reconstruction Tree
CSESCodeforces
- Persistent Segment Tree
- Treap and Implicit Treap
CodeforcesSPOJCSES
- Aho-Corasick Algorithm
CSESCodeforces
- Knuth Optimization
CodeforcesLuogu
- DSU with Rollback and Segment Tree on Time (Offline Dynamic Connectivity)
- CDQ Divide and Conquer
CSESCodeforcesLuogu
- Mo's Algorithm with Updates
- Mo's Algorithm on Trees
CodeforcesSPOJ
- XOR Basis (Linear Basis)
Codeforces
- König's Theorem and Hall's Theorem
CSESCodeforces