README.md

Programming Codes and Resources

• My collection of the solutions of some problems from different online judges and some useful collections.

• Contents

  • Algorithms

    • Codes
      • Math
        • segmented-sieve.cpp
        • nCr Precal.cpp
        • Euler Phi.cpp
        • nCr mod M (Not Prime).cpp
        • nCr mod M (Not Prime).cxx
        • Prime Sieve Linear.cpp
        • Modular Inverse 1 to N with Linear Time.cpp
        • Chinese Remainder Theorem (CRT).cpp
        • Discrete Logarithm | Shank`s Baby-step Giant-step Algorithm.cpp
        • Divisor Sum.cpp
        • Extended Euclid.cpp
      • String
        • Z-fuction.cpp
        • Longest Palindromic Substring (n*n).c
        • Aho Corasick.cpp
        • Suffix Array.cpp
        • Manacher.cpp
        • KMP.cpp
      • Data Structures
        • Persistance Trie.cpp
        • MO'S.cpp
        • BIT.cpp
        • unionFind.cpp
        • Hashing.cpp
        • 2D BIT.cpp
        • Persistance Trie.cxx
        • RMQ (Sparse Table).cpp
        • Dynamic Segment tree.cpp
        • 2D Segment Tree.cpp
        • Trie.cpp
        • SegmentTree with Lazy.cpp
        • Treap.c
        • Treap.cpp
        • Persistence Segment tree.cpp
      • Misc
        • Monotonic Queue.cpp
        • Merge Sort for LinkedList.c
        • Set (BST).c
        • bigint.cpp
        • Hashing.c
        • QuickSort.c
        • Merge Sort for Linked List (doubly).c
        • HeapSort.c
        • Sliding Window.cpp
        • Map (BST).c
      • Graph Theory
        • Strongly Connected Component.cpp
        • Stable Marriage Problem.cpp
        • Minimum Spanning Tree (Prim's).cpp
        • Articulation Point.cpp
        • Minimum Spanning Tree (kruskal).cpp
        • Dinkelbach Algorithm (Spanning tree ratio (min_max)).cpp
        • Dijkstra Second Shortest Path.cpp
        • Articulation Bridge.cpp
        • Dinkelbach Algorithm (Spanning tree ratio (min_max)).cxx
        • Topological Sort (lexicographically).cpp
        • Heavy-Light Decomposition.cpp
      • Dynamic Programming
        • Edit Distance.cpp
        • Longest Increasing Subsequence with Print.cpp
        • Longest Common Subsequence with Print.cpp
        • Knuth Optimization (Iterative).cpp
        • Longest Common Substring.cpp
        • Divide & Conquer.cpp
        • Longest Common Substring with Print.cpp
      • Matrix
        • Matrix Exponentiation.pdf
        • Gaussian Elimination.cpp
        • Matrix Exponentiation.cpp
      • Geometry
        • Convex Hull ( monotone chain).cpp
        • Convex Hull(Monotone_chain).cpp
        • Convex Hull (Graham Scan).cpp
      • Flow & Matching
        • Biparted Machting.cpp
        • Dinic (Maxflow).cpp
      • Game Theory
        • .Nim Game Example.tex.ini
        • One Pile Grandy(normal).cpp
        • Nim Game.tex
        • Hackenbush (simple).cpp
        • Nim Game Example – Suhendry’s Blog.pdf
      • Auxiliary Code
        • Sample Code.cpp
        • Header File.cpp
        • Bitset.cpp
        • Bit Magic.cpp
    • cheatsheet-math.pdf
    • Monotonic Queue.pdf
    • secuences.pdf
    • ReadMe.md
    • TeamBook.pdf