Tag Index

 Mo's Algorithm (1) XOR hashing (1) aho cosarick (1) ahu (1) algorithms (16) backtracking (1) binary lifting (1) bitset (1) c# (1) c++ (14) closest string problem (1) combinatorics (1) competitive programming (1) contests (1) convex hull trick (1) data structures (4) dfs (2) dynamic programming (4) fenwick tree (1) genetic algorithm (1) geometry (2) graphs (5) grundy numbers (1) heuristics (1) isomorphism (1) iterated local search (1) lca (1) math (1) modular arithmetic (1) np-hard (1) number theory (1) parallel algorithms (1) parallel binary search (1) prefix sum (2) programming (2) randomized algorithms (2) ranges (1) recursion (1) rust (1) segment trees (1) segtree (1) simulated annealing (1) sorting (1) sqrt decomposition (1) strings (2) treap (1) trees (7)

 Mo's Algorithm (1)

Solving a Graph Problem with Mo's Algorithm on Trees

 XOR hashing (1)

Solving a Problem with XOR Hashing

 aho cosarick (1)

A Nice Problem Involving Strings and Game Theory.

 ahu (1)

Isotree

 algorithms (16)

Bitsets are Awesome
A Split Graph Problem
Solving a Treap Data Structure Problem
A DP Optimization Trick on Trees
An Elegant Problem About Modular Arithmetic
Solving a Problem with XOR Hashing
Solving a Graph Problem with Mo's Algorithm on Trees
Solving a Problem with a Sparse Segment Tree.
A Trick for Rotating a 2D Grid
Finding the k-th Smallest Element in a Range with Parallel Binary Search.
A Nice Problem Involving Strings and Game Theory.
When I Used Stirling Numbers Without Knowing Them.
SegTree of Convex Hull Trick
Isotree
Competitive Programming
Closest String Problem

 backtracking (1)

Isotree

 binary lifting (1)

Solving a Graph Problem with Mo's Algorithm on Trees

 bitset (1)

Bitsets are Awesome

 c# (1)

A Split Graph Problem

 c++ (14)

Bitsets are Awesome
Solving a Treap Data Structure Problem
A DP Optimization Trick on Trees
An Elegant Problem About Modular Arithmetic
Solving a Problem with XOR Hashing
Solving a Graph Problem with Mo's Algorithm on Trees
Solving a Problem with a Sparse Segment Tree.
A Trick for Rotating a 2D Grid
A Nice Problem Involving Strings and Game Theory.
A Smarter Way to Read STL Containers in C++.
When I Used Stirling Numbers Without Knowing Them.
SegTree of Convex Hull Trick
Isotree
Closest String Problem

 closest string problem (1)

Closest String Problem

 combinatorics (1)

When I Used Stirling Numbers Without Knowing Them.

 competitive programming (1)

Competitive Programming

 contests (1)

Competitive Programming

 convex hull trick (1)

SegTree of Convex Hull Trick

 data structures (4)

Solving a Treap Data Structure Problem
Solving a Problem with a Sparse Segment Tree.
SegTree of Convex Hull Trick
Competitive Programming

 dfs (2)

A DP Optimization Trick on Trees
Solving a Graph Problem with Mo's Algorithm on Trees

 dynamic programming (4)

A DP Optimization Trick on Trees
A Nice Problem Involving Strings and Game Theory.
When I Used Stirling Numbers Without Knowing Them.
SegTree of Convex Hull Trick

 fenwick tree (1)

Finding the k-th Smallest Element in a Range with Parallel Binary Search.

 genetic algorithm (1)

Closest String Problem

 geometry (2)

A Trick for Rotating a 2D Grid
SegTree of Convex Hull Trick

 graphs (5)

Bitsets are Awesome
A Split Graph Problem
Solving a Graph Problem with Mo's Algorithm on Trees
When I Used Stirling Numbers Without Knowing Them.
Isotree

 grundy numbers (1)

A Nice Problem Involving Strings and Game Theory.

 heuristics (1)

Closest String Problem

 isomorphism (1)

Isotree
Closest String Problem

 lca (1)

Solving a Graph Problem with Mo's Algorithm on Trees

 math (1)

Competitive Programming

 modular arithmetic (1)

An Elegant Problem About Modular Arithmetic

 np-hard (1)

Closest String Problem

 number theory (1)

An Elegant Problem About Modular Arithmetic

 parallel algorithms (1)

Isotree
Finding the k-th Smallest Element in a Range with Parallel Binary Search.

 prefix sum (2)

A Split Graph Problem
A Trick for Rotating a 2D Grid

 programming (2)

A Smarter Way to Read STL Containers in C++.
Competitive Programming

 randomized algorithms (2)

Solving a Treap Data Structure Problem
Solving a Problem with XOR Hashing

 ranges (1)

A Smarter Way to Read STL Containers in C++.

 recursion (1)

An Elegant Problem About Modular Arithmetic

 rust (1)

Finding the k-th Smallest Element in a Range with Parallel Binary Search.

 segment trees (1)

SegTree of Convex Hull Trick

 segtree (1)

Solving a Problem with a Sparse Segment Tree.

 simulated annealing (1)

Closest String Problem

 sorting (1)

A Split Graph Problem

 sqrt decomposition (1)

Solving a Graph Problem with Mo's Algorithm on Trees

 strings (2)

A Nice Problem Involving Strings and Game Theory.
Closest String Problem

 treap (1)

Solving a Treap Data Structure Problem

 trees (7)

Solving a Treap Data Structure Problem
A DP Optimization Trick on Trees
Solving a Graph Problem with Mo's Algorithm on Trees
Solving a Problem with a Sparse Segment Tree.
A Nice Problem Involving Strings and Game Theory.
SegTree of Convex Hull Trick
Isotree