*Some time ago I collected useful links from Codeforces, some of them are really cool, some are not.**Dtaft was created about a year ago, now it is June of 2019.**My friend asked me to give him some cool blogs from Codeforces, and I remembered about that blog.**So that is the reason why this blog is posted)**P.S. some blogs are only in russian*

**algorithms**

Non-recursive segment tree tutorial Urbanowicz

Efficient and easy segment trees Al.Cash

Dynamic connectivity problem adamant

Suffiex tree. Basics. Build in O(nlogn) adamant

K-th statistics on a range yarrr

[Tutorial] Sack (dsu on tree) Arpa

Convex Hull Trick 300iq

Dynamic Programming Optimizations indy256

Parallel Binary Search [tutorial] himanshujaju

Counting Divisors of a Number in O(N^(1/3)) himanshujaju

SOS Dynamic Programming [Tutorial] usaxena95

DP on Trees Tutorial darkshadows

Online. Finding maximum frequent value in a range LittleMaster_7

Tutorial on FFT/NTT — The tough made simple.(Part 1) sidhant

Tutorial on FFT/NTT — The tough made simple.(Part 2) sidhant

Mo's Algorithm on Trees animeshf

Different solutions for KQUERY CtrlAlt

DP, learn to come up with relaxation goo.gl_SsAhv

Data Structure — Sqrt Fragmented Tree cjtoribio

Palindrome tree adamant

Algebra and geometry adamant

Manacher's algorithm and beautiful code adamant

Non-trivial DP Tricks and Techniques zscoder

Slope Trick zscoder

Programming tutorials for beginners Code Gyan aj95

Programming tutorials Code Gyan aj95

Everything about unordered_map Arpa

Lections from acm.math.spbu.ru

Geometry: 2D points and lines Al.Cash

About random. Proirities in treap jaguar1996

Suffix tree adamant

General idias adamant

Calculate 10^18-th fibonacci number in 25 lines kien_coi_1997

About euler tour ifsmirnov

Mo's Algorithm kAc

Some method for solving RMQ Arpa

subsets DP and paths in graphs Ripatti

persistent segment tree

Hashing and Probability of Collision rng_58

The "Bridge Tree" of a graph Baba

Two versions of the offline sqrt-decomp for dynamic min spanning tree pimenta

About ordered sets(fenwick) adamant

O(|V|^2*|E|^{1/2}) Implementation of Push-Relabel Max Flow Corei13

Minimum path cover in DAG SebiSebi

Online Convex Hull — queries in C++ set Errichto

Link-cut tree tasks qwerty787788

Z Algorithm paladin8

Tutorial on Heavy Light Decomposition + Problems anudeep2011

Find minimum prime divisor faster than sqrt(N) DreamingBoy

Fully Persistent Convex Hull Trick infinity

offline square root decomposition for dynamic min spanning tree pimenta

Partially Ordered Sets paladin8

Illustrated persistent segment tree tutorial oml1111

nCr % P , n and C is large and P is not prime ! najim4689

How does Dinic Max Flow compute the blocking flow in O(NM)? Tanzir5

Easy implementation of Compressed 2D BIT for grid of binary numbers[Tutorial] sdnr1

**tasks**

VK cup eliminations — Levels and Regions — higher limits Radewoosh

IOI 2016 comments Xellos

Interesting Tree problem — NEERC 2011 Silence_for_Melody

All Andrew Stankevich Contests Fefer_Ivan

Extending 700B: Connecting Universities minimario

Dynamic Programming Optimizations Problems khatribiru

Petr Mitrichev, Last 3 days in Sao Paulo Training Camp 2010 Hernan

Incredibly beautiful DP optimization from N^3 to N log^2 N 739E linkret

Decide if a number equals the sum of some submultiset of positive integers pimenta

Codechef Long problem DISTNUM3 rhezo

Sums(POI: 10, solved: 210) saliii

An array xor problem Confused101

i < j и a[i] > a[j], find sum of a[i] xor a[j] ironsoul

**useful mems**

C++ STL: Policy based data structures adamant

C++ STL: Policy based data structures. Часть 2 adamant

Treap from С++ STL Perlik

Easy geometry using std::complex Hikari9

Indexed set / array with wide functionality: treap Xellos

Graph saving methods Arpa

Generator for hashes with two modules about 10^9 I_love_natalia

C++11. All that you need Perlik

Catch stupid typos with GCC andreyv

Edmond's blossom C++ Implementation Kerpoo

I was expecting something a little different in “useful mems”

The same thing. More than a year passed since I made this blog and when I looked at this spoiler "useful mems" I was like "oh my god, those legendary codeforces mems".

And then I pressed the spoiler button and it was not...