Template summary

Number Theory

1. Modular multiplication:
2. Fermat's little theorem to find the number of combinations:
3. Euler function linear sieve:
4. SG function:
5. Mobius function linear sieve
(1) Mobius function summation formula understanding
( 2) Understanding of Euler function summation formula (reproduced)
(3) Summary of Euler function properties 6.01 Fractional programming
7. exgcd

Niubi

1. AC automaton:
2. FFT:
3. Suffix array

data structure

1. Modification of chairman tree interval:
2. BST:
3. Division tree:
4. RMQ-ST

Graph Theory

1. Diameter of the tree
2. LCA offline
3. LCA online
4. Binary matching
5. Minimum spanning tree Prim

basic dp

1. Longest Ascending Subsequence (LIS)

string

1. Horse drawn carriage

computational geometry

1. Pedestal coordinates

dp

1. Knapsack problem

Mathematical knowledge

1. First-order linear recurrence (generating function)
2. Second-order linear recurrence (generating function)
3. First-order ordinary differential equation

Electromagnetic Fields and Electromagnetic Waves

1. Electromagnetic wave speed

too lazy to write

1. Matrix overloading operator
2. Syntax tips
3. Finding the number of combinations (Fermat's little theorem)
3. Matching program