ototot / kiseki Goto Github PK

Maybe some contest still need to increase stack manually. Also, this might help us to write asm inside our code.

Those are efficient way to calculate multiplicative function

Segment tree beats is a powerful tool to solve sequence problem. Maybe we should have it.

This might be needed in some weird contests.

maybe this is great https://github.com/edisonhello/waynedisonitau123/blob/master/Codebook/math/FormalPowerSeries.cpp

Some weird people love cactus, so we might need cactus tree data structure.

There might be some Taiwan favor contests love 3D convex hull.

As title, it is great to optimize Dinic's algorithm with a low constant factor;

因為oT很爛，他連差分約束英文都不會，所以要學一下

The Point, Line, Segment class in this codebook consume lots of content and it might have bugs. However, many of them are useless. We should refactor them in a more concise way.

If someone is familiar with Treap, we can remove it.

oToToT is stupid at detecting negative cycle.

it might be great if we could avoid getting WA with multiple component

Currently, the code here is just randomly select an angle to rotate it and brute force on it.

Maybe a divide and conquer method or a simple scan line method should be included.

Sparse table is an easy data structure that might be memorized by someone. Maybe we could remove it.

A great way to use segment tree. Maybe someone remember it’s detail.

marking component need more test or we can just change it.

add shortcut in vimrc like this

WQS binary search is quite tricky. Maybe we could add it.