Skip to content

fbrunodr/CompetitiveProgramming

Folders and files

NameName
Last commit message
Last commit date

Latest commit

Β 

History

142 Commits
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 

Repository files navigation

Competitive Programming Algorithms and Data Structures

To generate the full source code for a test (without the includes, so you can upload it to an online judge as a single file), run

python3 expand_local_includes.py [FileName]

Test Coverage Report

🟑 AVLtree (need to test custom user updator)

πŸ”΄ ArticulationPointsAndBridges

🟑 BinarySearch (only last true has been used in tests)

πŸ”΄ CentroidDecomposition

πŸ”΄ DivideAndConquerDP

🟒 EulerianTrail

πŸ”΄ FastOfflineQueries

🟒 FenwickTree

🟑 GaussianElimination (need to add test to real valued one)

🟒 GraphCompression

🟒 LCA

🟒 MCBM

πŸ”΄ Maxflow

πŸ”΄ MergeSortTree

🟒 OrderStatisticsTree

πŸ”΄ RURQ

🟑 RollingHash (tested using tree Isomorphism, not directly)

🟒 SegTree

🟒 SparseTable

🟑 treeIsomorphism (need to add test the unrooted version)

🟒 UnionFind

πŸ”΄ centerOfSubtree

🟒 countInversions

πŸ”΄ fastPolynomialMultiplication

πŸ”΄ firstElementToLeft

πŸ”΄ integerGeometry

🟑 numberTheory (not all methods have been tested)

🟑 stringUtils (todo: prefixFunction and matchingPositions)


🟒 -> complete coverage

🟑 -> some coverage

πŸ”΄ -> no tests

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published