GitHub - overanalytcl/Competitive-programming: Useful competitive programming algorithms

Name		Name	Last commit message	Last commit date
Latest commit History 89 Commits
Bell numbers precomputation.cpp		Bell numbers precomputation.cpp
Big integers class without FFT.cpp		Big integers class without FFT.cpp
Binary Min-Heap.cpp		Binary Min-Heap.cpp
Bitwise GCD algorithm.cpp		Bitwise GCD algorithm.cpp
Catalan numbers precomputation.cpp		Catalan numbers precomputation.cpp
Classic primality test.cpp		Classic primality test.cpp
Extended euclidean algorithm.cpp		Extended euclidean algorithm.cpp
Fast exponentiation.cpp		Fast exponentiation.cpp
Heap algorithm for generating all permutations.cpp		Heap algorithm for generating all permutations.cpp
Inversion count with merge sort.cpp		Inversion count with merge sort.cpp
Linear time prime numbers sieve.cpp		Linear time prime numbers sieve.cpp
Longest increasing subarray (with reconstruction).cpp		Longest increasing subarray (with reconstruction).cpp
Miller-Rabin primality test.cpp		Miller-Rabin primality test.cpp
Sieve of Atkin.cpp		Sieve of Atkin.cpp
Sieve of Eratosthenes.cpp		Sieve of Eratosthenes.cpp
Stirling numbers of the second kind precomputation.cpp		Stirling numbers of the second kind precomputation.cpp
nth permutation generator.cpp		nth permutation generator.cpp