Advanced
Data Structures
Max Suffix Query with Insertions Only
Wavelet Tree
Counting Minimums with Segment Tree
Segment Tree Beats
Persistent Data Structures
Treaps
Convexity
LineContainer
Lagrangian Relaxation
Slope Trick
Graphs
Shortest Paths with Negative Edge Weights
Eulerian Tours
BCCs and 2CCs
Strongly Connected Components
Offline Deletion
Euler's Formula
Critical
Link Cut Tree
Dynamic Programming
DP on Trees - Combining Subtrees
Additional DP Optimizations and Techniques
Flows
Maximum Flow
Minimum Cut
Flow with Lower Bounds
Minimum Cost Flow
Polynomials
Introduction to Fast Fourier Transform
More Complex Operations Using FFT
Strings
String Searching
Suffix Array
String Suffix Structures
Misc. Topics
Extended Euclidean Algorithm
XOR Basis
Fracturing Search
Game Theory
Prefix Sums of Multiplicative Functions
Matroid Intersection
Interactive and Communication Problems
Settings
Contact Us
Prev
Home
Advanced
XOR Basis
Next
Prev
Home
Advanced
XOR Basis
Next
Rare
XOR Basis
Author: Benjamin Qi
Not Started
?
Table of Contents
Edit on Github
Resources
CF
DrSwad - Technique for Some XOR Related Problems
inspiration for below
Benq
XOR Presentation
used at USACO Camp
Benq
XOR Lab
8 related tasks
Module Progress
:
Not Started
Give Us Feedback on XOR Basis!
Message
Share Feedback
Prev
Home
Advanced
XOR Basis
Next
Table of Contents
Edit on Github
