How dinocodes2005/cp-codes works
This repository is a collection of independent Java competitive-programming solutions, not a unified application. The usual user workflow is to run one solution, provide that problem’s input, and read its output; sampled files show standalone entry points and locally implemented algorithms, with no shared runtime pipeline. The graph preserves the major contest collections and CSES problem domains, plus the four indexed core modules. No inter-module edges are shown: the index reports no cross-file references, and the empty README provides no further workflow evidence.
Components 23
Contest solutions
- AtCoder problems
AtCoder - Codeforces problems
Codeforces - CodeChef problems
Codechef - TLE 1400 problems
TLE_1400
CSES solutions
- Bitwise problems
CSES/Bitwise - Maximum XOR subarray
CSES/Bitwise/MaximumXorSubarray.java - Maximum XOR subset
CSES/Bitwise/MaximumXorSubset.java - Dynamic programming
CSES/DP - Geometry problems
CSES/Geometry - Graph problems
CSES/Graph - K shortest routes
CSES/Graph/FlightRoutes.java - Route connectivity check
CSES/Graph/FlightRoutesCheck.java - Single-source routes
CSES/Graph/ShortestRoutesI.java - All-pairs routes
CSES/Graph/ShortestRoutesII.java - Math problems
CSES/Math - Divisor analysis
CSES/Math/DivisorAnalysis.java - Range queries
CSES/Range Queries - Tree problems
CSES/Tree
Practice solutions
- CodeChef template
Codechef.java - Algorithm experiments
TestCodes
Standalone helpers
- Conversion snippet
Snippets/convert.py - Input generator
input_gen.py - Input runner
ran_inp.py