├── BigInt with fft(add,mult,div)___nlogn__10^5 length Number ├── Data Structure ├── Dsu on Tree ├── Fenwick Tree ├── Merge Sort Tree ├── Mo’s Algorithm (gilbertorder) ├── Segment Tree with lazy (range update ) ├── Sqrt Decomposition (add & sum) ├── Sum of all possible triplet product in an array ├── Fast Walsh Hadamard Transformation(All pair Xor___AND___OR Sum) ├── FenwickTree2D ├── HLD ├── Lis in every Query ___ when array element sum<=1000000 ├── Mo's Online ├── Mo’s Algorithm (normal, add, remove, query sort) ├── Mo’s on Tree ├── Mo’s with DSU ├── Mo’s with update ├── NTT & FFT ├── Persistent Trie ├── Segment Tree(single update) ├── Sparse Table ├── Treap ├── Trie (Xor Max Min) ├── Trie (subarray xor less then k) ├── l to r maximum subarray sum with update └── wavelet tree ├── GEOMETRY ├── Constructing a convex hull by Graham bypass___Nlogn ├── Convex hull___NlogN ├── Deleting points from Convex Hull ___(nlogn*q) ├── Finding the area of ​​the union of triangles ├── 3D Plane template ├── 3D geometry Template ├── Check point for belonging to a convex polygon ├── Circle Template ├── Dynamic Convex hull ___Adding Points to an Existing Convex Hull__complexity o(n*q) ├── Finding the largest inscribed circle in a convex polygon using a ternary search ├── Line 3D Template ├── Line Template ├── Picks Theorem (the number of points with integer coordinates that lie strictly inside the polygon) ├── Point Template ├── PolyGons ├── Polyhedrons ├── Segment Template └── Spherical geometry ├── Graph ├── Dominator Tree ├── MaxFlowMinCut(SPFA) ├── dynamic connectivity problem ├── Articulation Point ├── BellManFord (negative cycle ditect) ├── Blossom Algorithm (maximum matching in genarel graph) ├── BronKerbosch (Maximum clique) ├── Centroid Decomposition(Path Problem) ├── Centroid Decomposition(normal Implementation) ├── DSU ├── Dijkstra ├── Dinic's-Maxflow ├── Directed MST ├── Finding the shortest path of two node in every query ├── Floyed Warshall ├── HopcroftKarp (BPM Unweighted) ├── Kirchhoff matrix theorem(Finding the number of spanning trees) ├── LCA ├── LCA finding ____offline query ___O(1) time each query ├── MST └── Strongly Connected Component ├── JAVA BigInteger ├── MatExpo ├── Number Theory Notes ├── Numer Theory ├── ax+by=c everything ____extended euclid ├── n! % k^x==0 find x ├── BURNSIDE LEMMA ├── Baby Step-Giant Step ├── Chinese Remainder Theorem(Garner's) ├── DIVISORS ___SUM OF DIVISORS____MULT OF DIVISORS____ N<=10^16 ├── Expression solving ├── Factorial modulo (n!%p) ├── Farey Sequence ├── Linear Seive ├── Modular Inverse if mod is not prime ├── Modular inverse(1 to N)__O(N) ├── NUMBER OF DIVISORS (1-10^18) ├── NUMBER OF PRIME FACTOR(10^18) ├── NUMBER OF PRIME FACTOR(SQUFOF) Faster (10^18) ├── PRIME TEST (BPSW)(100%) ├── PRIME TEST(miller_robin) ├── Phi Function ├── Sum of Kth power____Find (1^k+2^k+...+n^k %) mod ├── floor number sum └── quadric resduie (can any sqrt(x) represents with a number) ├── README.md ├── Random Genarator ├── STRING ├── 2D hashing ├── Aho corasick ├── KMP ├── Rolling Hash ├── Suffix Array O(n) ├── Suffix Automaton └── palindromic Tree ├── Template c++ ├── Basic Template └── Super Template └── XOR ___ GCD___LCM ├── basis vector ├── All pair GCD ├── All pair GCD(II) ├── All pair LCM ├── GCD & XOR └── maximum pair lcm in an array /BigInt with fft(add,mult,div)___nlogn__10^5 length Number: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/BigInt with fft(add,mult,div)___nlogn__10^5 length Number -------------------------------------------------------------------------------- /Data Structure/ Dsu on Tree: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Data Structure/ Dsu on Tree -------------------------------------------------------------------------------- /Data Structure/ Fenwick Tree: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Data Structure/ Fenwick Tree -------------------------------------------------------------------------------- /Data Structure/ Merge Sort Tree: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Data Structure/ Merge Sort Tree -------------------------------------------------------------------------------- /Data Structure/ Mo’s Algorithm (gilbertorder): -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Data Structure/ Mo’s Algorithm (gilbertorder) -------------------------------------------------------------------------------- /Data Structure/ Segment Tree with lazy (range update ) : -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Data Structure/ Segment Tree with lazy (range update ) -------------------------------------------------------------------------------- /Data Structure/ Sqrt Decomposition (add & sum): -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Data Structure/ Sqrt Decomposition (add & sum) -------------------------------------------------------------------------------- /Data Structure/ Sum of all possible triplet product in an array: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Data Structure/ Sum of all possible triplet product in an array -------------------------------------------------------------------------------- /Data Structure/Fast Walsh Hadamard Transformation(All pair Xor___AND___OR Sum): -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Data Structure/Fast Walsh Hadamard Transformation(All pair Xor___AND___OR Sum) -------------------------------------------------------------------------------- /Data Structure/FenwickTree2D : -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Data Structure/FenwickTree2D -------------------------------------------------------------------------------- /Data Structure/HLD: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Data Structure/HLD -------------------------------------------------------------------------------- /Data Structure/Lis in every Query ___ when array element sum<=1000000 : -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Data Structure/Lis in every Query ___ when array element sum<=1000000 -------------------------------------------------------------------------------- /Data Structure/Mo's Online: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Data Structure/Mo's Online -------------------------------------------------------------------------------- /Data Structure/Mo’s Algorithm (normal, add, remove, query sort): -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Data Structure/Mo’s Algorithm (normal, add, remove, query sort) -------------------------------------------------------------------------------- /Data Structure/Mo’s on Tree : -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Data Structure/Mo’s on Tree -------------------------------------------------------------------------------- /Data Structure/Mo’s with DSU: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Data Structure/Mo’s with DSU -------------------------------------------------------------------------------- /Data Structure/Mo’s with update: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Data Structure/Mo’s with update -------------------------------------------------------------------------------- /Data Structure/NTT & FFT: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Data Structure/NTT & FFT -------------------------------------------------------------------------------- /Data Structure/Persistent Trie: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Data Structure/Persistent Trie -------------------------------------------------------------------------------- /Data Structure/Segment Tree(single update) : -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Data Structure/Segment Tree(single update) -------------------------------------------------------------------------------- /Data Structure/Sparse Table: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Data Structure/Sparse Table -------------------------------------------------------------------------------- /Data Structure/Treap: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Data Structure/Treap -------------------------------------------------------------------------------- /Data Structure/Trie (Xor Max Min): -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Data Structure/Trie (Xor Max Min) -------------------------------------------------------------------------------- /Data Structure/Trie (subarray xor less then k) : -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Data Structure/Trie (subarray xor less then k) -------------------------------------------------------------------------------- /Data Structure/l to r maximum subarray sum with update: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Data Structure/l to r maximum subarray sum with update -------------------------------------------------------------------------------- /Data Structure/wavelet tree : -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Data Structure/wavelet tree -------------------------------------------------------------------------------- /GEOMETRY / Constructing a convex hull by Graham bypass___Nlogn: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/GEOMETRY / Constructing a convex hull by Graham bypass___Nlogn -------------------------------------------------------------------------------- /GEOMETRY / Convex hull___NlogN: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/GEOMETRY / Convex hull___NlogN -------------------------------------------------------------------------------- /GEOMETRY / Deleting points from Convex Hull ___(nlogn*q) : -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/GEOMETRY / Deleting points from Convex Hull ___(nlogn*q) -------------------------------------------------------------------------------- /GEOMETRY / Finding the area of ​​the union of triangles : -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/GEOMETRY / Finding the area of ​​the union of triangles -------------------------------------------------------------------------------- /GEOMETRY /3D Plane template: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/GEOMETRY /3D Plane template -------------------------------------------------------------------------------- /GEOMETRY /3D geometry Template: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/GEOMETRY /3D geometry Template -------------------------------------------------------------------------------- /GEOMETRY /Check point for belonging to a convex polygon : -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/GEOMETRY /Check point for belonging to a convex polygon -------------------------------------------------------------------------------- /GEOMETRY /Circle Template: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/GEOMETRY /Circle Template -------------------------------------------------------------------------------- /GEOMETRY /Dynamic Convex hull ___Adding Points to an Existing Convex Hull__complexity o(n*q) : -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/GEOMETRY /Dynamic Convex hull ___Adding Points to an Existing Convex Hull__complexity o(n*q) -------------------------------------------------------------------------------- /GEOMETRY /Finding the largest inscribed circle in a convex polygon using a ternary search : -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/GEOMETRY /Finding the largest inscribed circle in a convex polygon using a ternary search -------------------------------------------------------------------------------- /GEOMETRY /Line 3D Template: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/GEOMETRY /Line 3D Template -------------------------------------------------------------------------------- /GEOMETRY /Line Template: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/GEOMETRY /Line Template -------------------------------------------------------------------------------- /GEOMETRY /Picks Theorem (the number of points with integer coordinates that lie strictly inside the polygon): -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/GEOMETRY /Picks Theorem (the number of points with integer coordinates that lie strictly inside the polygon) -------------------------------------------------------------------------------- /GEOMETRY /Point Template: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/GEOMETRY /Point Template -------------------------------------------------------------------------------- /GEOMETRY /PolyGons: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/GEOMETRY /PolyGons -------------------------------------------------------------------------------- /GEOMETRY /Polyhedrons: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/GEOMETRY /Polyhedrons -------------------------------------------------------------------------------- /GEOMETRY /Segment Template: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/GEOMETRY /Segment Template -------------------------------------------------------------------------------- /GEOMETRY /Spherical geometry : -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/GEOMETRY /Spherical geometry -------------------------------------------------------------------------------- /Graph/ Dominator Tree: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Graph/ Dominator Tree -------------------------------------------------------------------------------- /Graph/ MaxFlowMinCut(SPFA): -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Graph/ MaxFlowMinCut(SPFA) -------------------------------------------------------------------------------- /Graph/ dynamic connectivity problem: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Graph/ dynamic connectivity problem -------------------------------------------------------------------------------- /Graph/Articulation Point: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Graph/Articulation Point -------------------------------------------------------------------------------- /Graph/BellManFord (negative cycle ditect): -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Graph/BellManFord (negative cycle ditect) -------------------------------------------------------------------------------- /Graph/Blossom Algorithm (maximum matching in genarel graph): -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Graph/Blossom Algorithm (maximum matching in genarel graph) -------------------------------------------------------------------------------- /Graph/BronKerbosch (Maximum clique): -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Graph/BronKerbosch (Maximum clique) -------------------------------------------------------------------------------- /Graph/Centroid Decomposition(Path Problem) : -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Graph/Centroid Decomposition(Path Problem) -------------------------------------------------------------------------------- /Graph/Centroid Decomposition(normal Implementation): -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Graph/Centroid Decomposition(normal Implementation) -------------------------------------------------------------------------------- /Graph/DSU: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Graph/DSU -------------------------------------------------------------------------------- /Graph/Dijkstra: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Graph/Dijkstra -------------------------------------------------------------------------------- /Graph/Dinic's-Maxflow : -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Graph/Dinic's-Maxflow -------------------------------------------------------------------------------- /Graph/Directed MST : -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Graph/Directed MST -------------------------------------------------------------------------------- /Graph/Finding the shortest path of two node in every query: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Graph/Finding the shortest path of two node in every query -------------------------------------------------------------------------------- /Graph/Floyed Warshall: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Graph/Floyed Warshall -------------------------------------------------------------------------------- /Graph/HopcroftKarp (BPM Unweighted) : -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Graph/HopcroftKarp (BPM Unweighted) -------------------------------------------------------------------------------- /Graph/Kirchhoff matrix theorem(Finding the number of spanning trees) : -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Graph/Kirchhoff matrix theorem(Finding the number of spanning trees) -------------------------------------------------------------------------------- /Graph/LCA: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Graph/LCA -------------------------------------------------------------------------------- /Graph/LCA finding ____offline query ___O(1) time each query : -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Graph/LCA finding ____offline query ___O(1) time each query -------------------------------------------------------------------------------- /Graph/MST: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Graph/MST -------------------------------------------------------------------------------- /Graph/Strongly Connected Component: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Graph/Strongly Connected Component -------------------------------------------------------------------------------- /JAVA BigInteger: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/JAVA BigInteger -------------------------------------------------------------------------------- /MatExpo: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/MatExpo -------------------------------------------------------------------------------- /Number Theory Notes: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Number Theory Notes -------------------------------------------------------------------------------- /Numer Theory/ ax+by=c everything ____extended euclid : -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Numer Theory/ ax+by=c everything ____extended euclid -------------------------------------------------------------------------------- /Numer Theory/ n! % k^x==0 find x: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Numer Theory/ n! % k^x==0 find x -------------------------------------------------------------------------------- /Numer Theory/BURNSIDE LEMMA: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Numer Theory/BURNSIDE LEMMA -------------------------------------------------------------------------------- /Numer Theory/Baby Step-Giant Step : -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Numer Theory/Baby Step-Giant Step -------------------------------------------------------------------------------- /Numer Theory/Chinese Remainder Theorem(Garner's): -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Numer Theory/Chinese Remainder Theorem(Garner's) -------------------------------------------------------------------------------- /Numer Theory/DIVISORS ___SUM OF DIVISORS____MULT OF DIVISORS____ N<=10^16 : -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Numer Theory/DIVISORS ___SUM OF DIVISORS____MULT OF DIVISORS____ N<=10^16 -------------------------------------------------------------------------------- /Numer Theory/Expression solving: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Numer Theory/Expression solving -------------------------------------------------------------------------------- /Numer Theory/Factorial modulo (n!%p) : -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Numer Theory/Factorial modulo (n!%p) -------------------------------------------------------------------------------- /Numer Theory/Farey Sequence: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Numer Theory/Farey Sequence -------------------------------------------------------------------------------- /Numer Theory/Linear Seive : -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Numer Theory/Linear Seive -------------------------------------------------------------------------------- /Numer Theory/Modular Inverse if mod is not prime: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Numer Theory/Modular Inverse if mod is not prime -------------------------------------------------------------------------------- /Numer Theory/Modular inverse(1 to N)__O(N): -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Numer Theory/Modular inverse(1 to N)__O(N) -------------------------------------------------------------------------------- /Numer Theory/NUMBER OF DIVISORS (1-10^18): -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Numer Theory/NUMBER OF DIVISORS (1-10^18) -------------------------------------------------------------------------------- /Numer Theory/NUMBER OF PRIME FACTOR(10^18): -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Numer Theory/NUMBER OF PRIME FACTOR(10^18) -------------------------------------------------------------------------------- /Numer Theory/NUMBER OF PRIME FACTOR(SQUFOF) Faster (10^18): -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Numer Theory/NUMBER OF PRIME FACTOR(SQUFOF) Faster (10^18) -------------------------------------------------------------------------------- /Numer Theory/PRIME TEST (BPSW)(100%): -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Numer Theory/PRIME TEST (BPSW)(100%) -------------------------------------------------------------------------------- /Numer Theory/PRIME TEST(miller_robin) : -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Numer Theory/PRIME TEST(miller_robin) -------------------------------------------------------------------------------- /Numer Theory/Phi Function: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Numer Theory/Phi Function -------------------------------------------------------------------------------- /Numer Theory/Sum of Kth power____Find (1^k+2^k+...+n^k %) mod : -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Numer Theory/Sum of Kth power____Find (1^k+2^k+...+n^k %) mod -------------------------------------------------------------------------------- /Numer Theory/floor number sum: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Numer Theory/floor number sum -------------------------------------------------------------------------------- /Numer Theory/quadric resduie (can any sqrt(x) represents with a number): -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Numer Theory/quadric resduie (can any sqrt(x) represents with a number) -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/README.md -------------------------------------------------------------------------------- /Random Genarator: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Random Genarator -------------------------------------------------------------------------------- /STRING/ 2D hashing: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/STRING/ 2D hashing -------------------------------------------------------------------------------- /STRING/Aho corasick : -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/STRING/Aho corasick -------------------------------------------------------------------------------- /STRING/KMP: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/STRING/KMP -------------------------------------------------------------------------------- /STRING/Rolling Hash : -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/STRING/Rolling Hash -------------------------------------------------------------------------------- /STRING/Suffix Array O(n): -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/STRING/Suffix Array O(n) -------------------------------------------------------------------------------- /STRING/Suffix Automaton: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/STRING/Suffix Automaton -------------------------------------------------------------------------------- /STRING/palindromic Tree: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/STRING/palindromic Tree -------------------------------------------------------------------------------- /Template c++/Basic Template: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Template c++/Basic Template -------------------------------------------------------------------------------- /Template c++/Super Template: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/Template c++/Super Template -------------------------------------------------------------------------------- /XOR ___ GCD___LCM/ basis vector : -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/XOR ___ GCD___LCM/ basis vector -------------------------------------------------------------------------------- /XOR ___ GCD___LCM/All pair GCD: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/XOR ___ GCD___LCM/All pair GCD -------------------------------------------------------------------------------- /XOR ___ GCD___LCM/All pair GCD(II): -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/XOR ___ GCD___LCM/All pair GCD(II) -------------------------------------------------------------------------------- /XOR ___ GCD___LCM/All pair LCM : -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/XOR ___ GCD___LCM/All pair LCM -------------------------------------------------------------------------------- /XOR ___ GCD___LCM/GCD & XOR: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/XOR ___ GCD___LCM/GCD & XOR -------------------------------------------------------------------------------- /XOR ___ GCD___LCM/maximum pair lcm in an array : -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Foysal87/competitive_programming_codebook/HEAD/XOR ___ GCD___LCM/maximum pair lcm in an array --------------------------------------------------------------------------------